Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs

zbMath1431.05094arXiv1810.12433MaRDI QIDQ5210983

Daniela Kühn, Deryk Osthus, Jae-Hoon Kim, Alberto Espuny Díaz, Padraig Condon

Publication date: 17 January 2020

Full work available at URL: https://arxiv.org/abs/1810.12433

zbMATH Keywords

Chvátal's theorem; Pósa's theorem

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C45: Eulerian and Hamiltonian graphs

05C07: Vertex degrees