Proof of the 1-factorization and Hamilton Decomposition Conjectures
From MaRDI portal
Publication:5283773
DOI10.1090/MEMO/1154zbMATH Open1367.05165OpenAlexW1493850023MaRDI QIDQ5283773FDOQ5283773
Authors: Béla Csaba, Daniela Kühn, Allan Lo, Deryk Osthus, Andrew Treglown 
Publication date: 25 July 2017
Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/23746247/1401.4159v2
Recommendations
- Proof of the 1-factorization and Hamilton decomposition conjectures
- A note on the factorization conjecture
- On the factorization conjecture
- scientific article; zbMATH DE number 3106630
- scientific article; zbMATH DE number 3106635
- On the perfect one-factorization conjecture
- A proof of the Pfister factor conjecture
- A combinatorial proof of the Cayley-Hamilton theorem
- scientific article
- Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- The NP-Completeness of Edge-Coloring
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- The robust component structure of dense regular graphs and applications
- Title not available (Why is that?)
- Hamiltonian degree sequences in digraphs
- Minimum degree of a graph and the existence of k-factors
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Hamilton decompositions of regular expanders: applications
- Approximate Hamilton decompositions of robustly expanding regular digraphs
- Counting and packing Hamilton cycles in dense graphs and oriented graphs
- Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree
- Edge-disjoint Hamilton cycles in random graphs
- Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs
- Edge-disjoint Hamilton cycles in graphs
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- Regular Graphs of High Degree are 1-Factorizable
- Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree
- Hamilton decompositions of regular tournaments
- Optimal Packings of Hamilton Cycles in Sparse Random Graphs
- 1-factorizing regular graphs of high degree - an improved bound
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- Edge coloring regular graphs of high degree
- All regular multigraphs of even order and high degree are 1-factorable
- An Asymptotic Version of the Multigraph 1‐Factorization Conjecture
Cited In (43)
- A Rainbow Dirac's Theorem
- Regular decomposition of the edge set of a graph with applications
- Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem
- Number of 1-factorizations of regular high-degree graphs
- Minimum degree conditions for monochromatic cycle partitioning
- Tree decompositions of graphs without large bipartite holes
- The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree
- Almost all regular graphs are hamiltonian
- A blow-up lemma for approximate decompositions
- Chvátal-Erdős condition for pancyclicity
- Decomposition of 4k-regular graphs into k 4-regular K5-free and (K5 − e)-free subgraphs
- Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles
- Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
- Many Hamiltonian subsets in large graphs with given density
- Title not available (Why is that?)
- Decomposing hypergraphs into cycle factors
- Graph and hypergraph packing
- A greedy algorithm for the social golfer and the Oberwolfach problem
- Title not available (Why is that?)
- Hamilton cycles in pseudorandom graphs
- Packing degenerate graphs
- Resolution of the Oberwolfach problem
- Counting and packing Hamilton cycles in dense graphs and oriented graphs
- Properties, proved and conjectured, of Keller, Mycielski, and queen graphs
- Chromatic index of dense quasirandom graphs
- Resolution of the Oberwolfach problem
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- Packing, counting and covering Hamilton cycles in random directed graphs
- A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs
- The chromatic index of strongly regular graphs
- The number of Hamiltonian decompositions of regular graphs
- A note on Hamilton decompositions of even-regular multigraphs
- Interview with Benny Sudakov
- The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)
- Edge coloring graphs with large minimum degree
- Path and cycle decompositions of dense graphs
- On a conjecture that strengthens Kundu's \(k\)-factor theorem
- Graph edge coloring: a survey
- Independence number and the normalized Laplacian eigenvalue one
- An approximate version of Jackson’s conjecture
- Optimal patrolling strategies for trees and complete networks
- Compatible Hamilton cycles in Dirac graphs
- Decomposing tournaments into paths
This page was built for publication: Proof of the 1-factorization and Hamilton Decomposition Conjectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283773)
