Proves robust percolation and hyperstability extensions of the Erdős-Gallai theorem guaranteeing long cycles in graphs of given average degree.
Riordan, Long cycles in random subgraphs of graphs with large minimum degree,Random Structures Algorithms45(2014), 764–767
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
-
Robustness and hyperstability for the Erd\H{o}s-Gallai theorem
Proves robust percolation and hyperstability extensions of the Erdős-Gallai theorem guaranteeing long cycles in graphs of given average degree.