Embedding spanning subgraphs in uniformly dense and inseparable graphs

DOI10.1002/rsa.20957zbMath1457.05059arXiv1909.13071OpenAlexW3080664976MaRDI QIDQ3386528

Christian Reiher, Oliver Ebsen, Giulia S. Maesaka, Mathias Schacht, Bjarne Schülke

Publication date: 5 January 2021

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

absorption methodpowers of Hamiltonian cyclesbandwidth theorem

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)

Related Items (3)

Minimum Degrees for Powers of Paths and Cycles ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ The bandwidth theorem for locally dense graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Ramsey number of a graph with bounded maximum degree
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Proof of the Seymour conjecture for large graphs
• Blow-up lemma
• Triangle factors of graphs without large independent sets and of weighted graphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• The Blow-up Lemma
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Squares of Hamiltonian cycles in 3‐uniform hypergraphs
• The bandwidth theorem for locally dense graphs
• Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
• On the maximal number of independent circuits in a graph
• Some Theorems on Abstract Graphs

This page was built for publication: Embedding spanning subgraphs in uniformly dense and inseparable graphs