EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS

DOI10.1112/mtk.12005zbMath1441.05159OpenAlexW3015052924MaRDI QIDQ5112840

Yury Person, Richard Montgomery, Julia Böttcher, Olaf Parczyk

Publication date: 9 June 2020

Published in: Mathematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/mtk.12005

zbMATH Keywords

randomly perturbed dense graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)

Related Items (17)

Triangles in randomly perturbed graphs ⋮ Large Rainbow Cliques in Randomly Perturbed Dense Graphs ⋮ Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu ⋮ High powers of Hamiltonian cycles in randomly augmented graphs ⋮ Factors in randomly perturbed hypergraphs ⋮ Rainbow trees in uniformly edge‐colored graphs ⋮ Hamiltonicity of graphs perturbed by a random regular graph ⋮ On powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Hamiltonicity of graphs perturbed by a random geometric graph ⋮ Speeding up random walk mixing by starting from a uniform vertex ⋮ Dirac-type conditions for spanning bounded-degree hypertrees ⋮ The bandwidth theorem for locally dense graphs ⋮ Tilings in Randomly Perturbed Dense Graphs ⋮ Vertex Ramsey properties of randomly perturbed graphs ⋮ Small rainbow cliques in randomly perturbed dense graphs ⋮ Ramsey properties of randomly perturbed graphs: cliques and cycles ⋮ Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs

Cites Work

• Hall's theorem for hypergraphs

This page was built for publication: EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS