A new spectral argument shows that very dense graphs far from unions of cliques have least eigenvalue at most -n^{1/4-epsilon}, and this yields max-cut surpluses of order n^{1.01} and m^{0.5001} for H-free graphs.
On MaxCut and the Lov´ asz theta function
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
An Alon-Boppana--type bound for very dense graphs, with applications to max-cut
A new spectral argument shows that very dense graphs far from unions of cliques have least eigenvalue at most -n^{1/4-epsilon}, and this yields max-cut surpluses of order n^{1.01} and m^{0.5001} for H-free graphs.