A new dichotomy about C4-free induced subgraphs and dense patches yields optimal O(sn) bounds for geometric Zarankiewicz problems and a near-tight semilinear bound.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
$C_4$-free subgraphs of high degree with geometric applications
A new dichotomy about C4-free induced subgraphs and dense patches yields optimal O(sn) bounds for geometric Zarankiewicz problems and a near-tight semilinear bound.