Proves that tori, spheres, and cubes admit thresholds for all monotone properties in random geometric graphs by connecting thresholds to uniform expansion.
and Erdős, P.,On a Ramsey–Turán type problem, J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Thresholds for geometric graphs
Proves that tori, spheres, and cubes admit thresholds for all monotone properties in random geometric graphs by connecting thresholds to uniform expansion.