On sufficient conditions for spanning structures in dense graphs
From MaRDI portal
Publication:6075109
DOI10.1112/plms.12552zbMath1521.05082arXiv2110.14547OpenAlexW4385070090MaRDI QIDQ6075109
Richard Lang, Nicolás Sanhueza-Matamala
Publication date: 20 September 2023
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.14547
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A degree sequence Hajnal-Szemerédi theorem
- An Ore-type theorem on Hamiltonian square cycles
- Hamilton cycles in dense vertex-transitive graphs
- Hamilton cycles in highly connected and expanding graphs
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs
- Quadripartite version of the Hajnal-Szemerédi theorem
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Hamiltonian degree sequences in digraphs
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Proof of the Seymour conjecture for large graphs
- Blow-up lemma
- Tripartite version of the Corrádi-Hajnal theorem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- On perfect packings in dense graphs
- Powers of Hamiltonian cycles in multipartite graphs
- A degree sequence version of the Kühn-Osthus tiling theorem
- Completion and deficiency problems
- A proof of Ringel's conjecture
- A multipartite Hajnal-Szemerédi theorem
- Recent advances on the Hamiltonian problem: survey III
- An Ore-type theorem on equitable coloring
- Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs
- On Hamilton's ideals
- Large planar subgraphs in dense graphs
- On Hamiltonian bipartite graphs
- A Hoeffding inequality for Markov chains
- Forcing spanning subgraphs via Ore type conditions
- The robust component structure of dense regular graphs and applications
- On Degree Sequences Forcing The Square of a Hamilton Cycle
- Finding Hamilton cycles in robustly expanding digraphs
- Note on Hamilton Circuits
- Embedding spanning subgraphs in uniformly dense and inseparable graphs
- An Ore-type Theorem for Perfect Packings in Graphs
- Embedding large subgraphs into dense graphs
- A Chernoff Bound for Random Walks on Expander Graphs
- An algorithmic version of the blow-up lemma
- [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
- Embedding Spanning Bipartite Graphs of Small Bandwidth
- A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
- A bandwidth theorem for approximate decompositions
- A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs
- The Bandwidth Theorem in sparse graphs
- A rainbow blow‐up lemma
- The bandwidth theorem for locally dense graphs
- An asymptotic bound for the strong chromatic number
- A Degree Sequence Komlós Theorem
- Rainbow matchings in Dirac bipartite graphs
- A geometric theory for hypergraph matching
- Some Theorems on Abstract Graphs
- On deficiency problems for graphs
- Concentration of Measure for the Analysis of Randomized Algorithms
- Minimum degree conditions for tight Hamilton cycles
This page was built for publication: On sufficient conditions for spanning structures in dense graphs
