Proves finite chromatic number for any 2D lacunary integer distance graph in Z^2 by extending the lonely set method via Broderick-Fishman-Kleinbock theorem and explicit geometric coloring.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Target-avoidance sets for Manneville-Pomeau maps are α-strong winning for Schmidt's game with uniform α > 0.
citing papers explorer
-
Proof of the Finiteness of the Chromatic Number of Two-Dimensional Lacunary Distance Graphs
Proves finite chromatic number for any 2D lacunary integer distance graph in Z^2 by extending the lonely set method via Broderick-Fishman-Kleinbock theorem and explicit geometric coloring.
-
Strong-Winning Target Avoidance for Manneville--Pomeau Maps
Target-avoidance sets for Manneville-Pomeau maps are α-strong winning for Schmidt's game with uniform α > 0.