A clique version of the Erd\H{o}s-Gallai stability theorems
Combinatorics
2020-11-03 v2
Abstract
Combining P\'{o}sa's rotation lemma with a technique of Kopylov in a novel approach, we prove a generalization of the Erd\H{o}s-Gallai theorems on cycles and paths. This implies a clique version of the Erd\H{o}s-Gallai stability theorems and also provides alternative proofs for some recent results.
Cite
@article{arxiv.2010.13667,
title = {A clique version of the Erd\H{o}s-Gallai stability theorems},
author = {Jie Ma and Long-Tu Yuan},
journal= {arXiv preprint arXiv:2010.13667},
year = {2020}
}