Optimal Hamilton covers and linear arboricity for random graphs
From MaRDI portal
Cites work
- An improved bound for the linear arboricity conjecture
- Edge-disjoint Hamilton cycles in random graphs
- Hamilton cycles in highly connected and expanding graphs
- Hamilton decompositions of regular expanders: applications
- scientific article; zbMATH DE number 3950585 (Why is no real title available?)
- scientific article; zbMATH DE number 3717365 (Why is no real title available?)
- scientific article; zbMATH DE number 3349889 (Why is no real title available?)
- scientific article; zbMATH DE number 3198027 (Why is no real title available?)
- Linear arboricity of random regular graphs
- On a packing and covering problem
- On covering expander graphs by Hamilton cycles
- On the difference between asymptotically good packings and coverings
- On two Hamilton cycle problems in random graphs
- Optimal covers with Hamilton cycles in random graphs
- Optimal packings of Hamilton cycles in sparse random graphs
- Optimal path and cycle decompositions of dense quasirandom graphs
- Packing tree factors in random and pseudo-random graphs
- Packing, counting and covering Hamilton cycles in random directed graphs
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- Random graphs.
- Rolling backwards can move you forward: on embedding problems in sparse expanders
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- The linear arboricity of graphs
This page was built for publication: Optimal Hamilton covers and linear arboricity for random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028989)
