Proof of the 1-factorization and Hamilton Decomposition Conjectures
From MaRDI portal
Publication:5283773
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; zbMATH DE number 147634
- Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
Cites work
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 3273761 (Why is no real title available?)
- scientific article; zbMATH DE number 3353326 (Why is no real title available?)
- scientific article; zbMATH DE number 3353327 (Why is no real title available?)
- 1-factorizing regular graphs of high degree - an improved bound
- All regular multigraphs of even order and high degree are 1-factorable
- An asymptotic version of the multigraph 1-factorization conjecture
- Approximate Hamilton decompositions of robustly expanding regular digraphs
- Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs
- Counting and packing Hamilton cycles in dense graphs and oriented graphs
- Edge coloring regular graphs of high degree
- Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree
- Edge-disjoint Hamilton cycles in graphs
- Edge-disjoint Hamilton cycles in random graphs
- Graph edge coloring. Vizing's theorem and Goldberg's conjecture
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Hamilton decompositions of regular expanders: applications
- Hamilton decompositions of regular tournaments
- Hamiltonian degree sequences in digraphs
- Minimum degree of a graph and the existence of k-factors
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- Optimal packings of Hamilton cycles in graphs of high minimum degree
- Optimal packings of Hamilton cycles in sparse random graphs
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- Regular Graphs of High Degree are 1-Factorizable
- The NP-Completeness of Edge-Coloring
- The robust component structure of dense regular graphs and applications
Cited in
(46)- Optimal patrolling strategies for trees and complete networks
- Decomposing tournaments into paths
- Regular decomposition of the edge set of a graph with applications
- Number of 1-factorizations of regular high-degree graphs
- Minimum degree conditions for monochromatic cycle partitioning
- Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem
- A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs
- Tree decompositions of graphs without large bipartite holes
- Almost all regular graphs are hamiltonian
- A blow-up lemma for approximate decompositions
- Chvátal-Erdős condition for pancyclicity
- An approximate version of Jackson's conjecture
- Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles
- A rainbow Dirac's theorem
- Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
- The overfullness of graphs with small minimum degree and large maximum degree
- Decomposing hypergraphs into cycle factors
- scientific article; zbMATH DE number 825148 (Why is no real title available?)
- Many Hamiltonian subsets in large graphs with given density
- A greedy algorithm for the social golfer and the Oberwolfach problem
- scientific article; zbMATH DE number 3896976 (Why is no real title available?)
- Graph and hypergraph packing
- Packing degenerate graphs
- Hamilton cycles in pseudorandom graphs
- Counting and packing Hamilton cycles in dense graphs and oriented graphs
- Resolution of the Oberwolfach problem
- Chromatic index of dense quasirandom graphs
- Resolution of the Oberwolfach problem
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- Properties, proved and conjectured, of Keller, Mycielski, and queen graphs
- Proof of the 1-factorization and Hamilton decomposition conjectures
- Decomposition of \(4k\)-regular graphs into \(k\, 4\)-regular \(K_5\)-free and \((K_5\text{-}e)\)-free subgraphs
- Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
- The chromatic index of strongly regular graphs
- Packing, counting and covering Hamilton cycles in random directed graphs
- The number of Hamiltonian decompositions of regular graphs
- The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)
- A note on Hamilton decompositions of even-regular multigraphs
- Interview with Benny Sudakov
- 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
- Compatible Hamilton cycles in Dirac graphs
- Optimal packings of Hamilton cycles in graphs of high minimum degree
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)
