The authors determine the exact VC-dimension-interpolated homomorphism thresholds for cliques and prove the blowup threshold of odd cycles C_{2k-1} is 1/(2k-1).
On short edges in complete topological graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Let $h(n)$ be the minimum integer such that every complete $n$-vertex simple topological graph contains an edge that crosses at most $h(n)$ other edges. In 2009, Kyn\v{c}l and Valtr showed that $h(n) = O(n^2/\log^{1/4} n)$, and in the other direction, gave constructions showing that $h(n) = \Omega(n^{3/2})$. In this paper, we prove that $h(n) = O(n^{7/4})$. Along the way, we establish a new variant of Chazelle and Welzl's matching theorem for set systems with bounded VC-dimension, which we believe to be of independent interest.
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Interpolating chromatic and homomorphism thresholds
The authors determine the exact VC-dimension-interpolated homomorphism thresholds for cliques and prove the blowup threshold of odd cycles C_{2k-1} is 1/(2k-1).