REVIEW 1 cited by
On short edges in complete topological graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
Forward citations
Cited by 1 Pith paper
-
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).
Discussion (0). Continue with ORCID to comment.