Tight minimum degree condition to guarantee -free graphs to be -partite
Z Yan, Y Peng, X Yuan - arXiv preprint arXiv:2409.03407, 2024 - arxiv.org
Erd\H {o} s and Simonovits asked the following question: For an integer $ c\geq 2$ and a
family of graphs $\mathcal {F} $, what is the infimum of $\alpha $ such that any $\mathcal {F} …
family of graphs $\mathcal {F} $, what is the infimum of $\alpha $ such that any $\mathcal {F} …
Minimum degree stability of C 2 k+ 1 C_2k+1‐free graphs
X Yuan, Y Peng - Journal of Graph Theory, 2024 - Wiley Online Library
We consider the minimum degree stability of graphs forbidding odd cycles: What is the tight
bound on the minimum degree to guarantee that the structure of a C 2 k+ 1 C_2k+1‐free …
bound on the minimum degree to guarantee that the structure of a C 2 k+ 1 C_2k+1‐free …