Local resilience for squares of almost spanning cycles in sparse random graphs

zbMath1441.05204arXiv1606.02958MaRDI QIDQ2409840

Andreas Noever, Angelika Steger

Publication date: 16 October 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

random graphsresiliencealmost spanning subgraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Density (toughness, etc.) (05C42)

Related Items (2)

Dirac-type theorems in random hypergraphs ⋮ Counting extensions revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the KŁR conjecture in random graphs
• Small subsets inherit sparse \(\varepsilon\)-regularity
• Almost all regular graphs are Hamiltonian
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Blow-up lemma
• Counting extensions
• Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
• Dirac's theorem for random graphs
• Szemerédi’s Regularity Lemma for Sparse Graphs
• On the square of a Hamiltonian cycle in dense graphs
• On Pósa's Conjecture for Random Graphs
• The Bandwidth Theorem in sparse graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Local resilience for squares of almost spanning cycles in sparse random graphs