An approximate version of Jackson’s conjecture

DOI10.1017/S0963548320000152zbMath1466.05083arXiv1907.08479OpenAlexW3040670847WikidataQ123001938 ScholiaQ123001938MaRDI QIDQ4993113

Yanitsa Pehova, Anita Liebenau

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

Hamilton cyclediregular bipartite tournament

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian decompositions of complete graphs
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• Hamiltonian decomposition of complete regular multipartite digraphs
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• Hamilton decompositions of regular expanders: applications
• Introduction to Random Graphs
• Note on Hamilton Circuits
• Hamilton decompositions of regular tournaments
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• Long paths and cycles in oriented graphs
• Hamilton Cycles in Oriented Graphs
• Counting Hamilton Decompositions of Oriented Graphs
• Proof of the 1-factorization and Hamilton Decomposition Conjectures
• Some Theorems on Abstract Graphs

This page was built for publication: An approximate version of Jackson’s conjecture