Proves a minimum-degree stability theorem: n-vertex graphs with δ(G) ≥ (2/(2g+1) + ε)n either contain C_{2g-1}[t] or are O(n^{2-ρ})-close to bipartite, for some ρ>0 depending on g,t,ε.
On the connection between chromatic number, maximal clique and minimal degree of a graph
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
π_link(t) ≤ 1 - t^{-1} - t^{-2}/12 for every t ≥ 2, which determines the order of the gap to the trivial bound 1 - t^{-1} up to a constant factor when paired with Goldwasser's lower bound for prime-power t-1.
citing papers explorer
-
Minimum degree stability for graphs without odd-cycle blow-up
Proves a minimum-degree stability theorem: n-vertex graphs with δ(G) ≥ (2/(2g+1) + ε)n either contain C_{2g-1}[t] or are O(n^{2-ρ})-close to bipartite, for some ρ>0 depending on g,t,ε.
-
A note on the $t$-partite link problem of F\"uredi
π_link(t) ≤ 1 - t^{-1} - t^{-2}/12 for every t ≥ 2, which determines the order of the gap to the trivial bound 1 - t^{-1} up to a constant factor when paired with Goldwasser's lower bound for prime-power t-1.