The Overfull Conjecture holds for robust expanders with density constraints, implying it for all sufficiently large graphs with maximum degree at least (1+ε)|V(G)|/2.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Towards the Overfull Conjecture II
The Overfull Conjecture holds for robust expanders with density constraints, implying it for all sufficiently large graphs with maximum degree at least (1+ε)|V(G)|/2.