REVIEW 2 cited by
Induced even cycles in locally sparse 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
A graph $G$ is $(c,t)$-sparse if for every pair of vertex subsets $A,B\subset V(G)$ with $|A|,|B|\geq t$, $e(A,B)\leq (1-c)|A||B|$. In this paper we prove that for every $c>0$ and integer $\ell$, there exists $C>1$ such that if an $n$-vertex graph $G$ is $(c,t)$-sparse for some $t$, and has at least $C t^{1-1/\ell}n^{1+1/\ell}$ edges, then $G$ contains an induced copy of $C_{2\ell}$. This resolves a conjecture of Fox, Nenadov and Pham.
Forward citations
Cited by 2 Pith papers
-
$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.
-
Supersaturation of induced even cycles in locally sparse graphs
For every integer ℓ≥2, any (1−ε,t)-sparse n-vertex graph with at least C t^{1−1/ℓ} n^{1+1/ℓ} edges contains at least C' d^{2ℓ} induced copies of the even cycle C_{2ℓ}, where d is its average degree.
Discussion (0). Continue with ORCID to comment.