A survey on Hamilton cycles in directed graphs
From MaRDI portal
(Redirected from Publication:412269)
Abstract: We survey some recent results on long-standing conjectures regarding Hamilton cycles in directed graphs, oriented graphs and tournaments. We also combine some of these to prove the following approximate result towards Kelly's conjecture on Hamilton decompositions of regular tournaments: the edges of every regular tournament can be covered by a set of Hamilton cycles which are `almost' edge-disjoint. We also highlight the role that the notion of `robust expansion' plays in several of the proofs. New and old open problems are discussed.
Recommendations
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Hamilton decompositions of regular expanders: applications
- Counting Hamilton decompositions of oriented graphs
- Hamilton decompositions of regular tournaments
- Approximate Hamilton decompositions of robustly expanding regular digraphs
Cites work
- scientific article; zbMATH DE number 3149611 (Why is no real title available?)
- scientific article; zbMATH DE number 3150485 (Why is no real title available?)
- scientific article; zbMATH DE number 3914351 (Why is no real title available?)
- scientific article; zbMATH DE number 3929043 (Why is no real title available?)
- scientific article; zbMATH DE number 3508537 (Why is no real title available?)
- scientific article; zbMATH DE number 3632516 (Why is no real title available?)
- scientific article; zbMATH DE number 1047732 (Why is no real title available?)
- scientific article; zbMATH DE number 3993619 (Why is no real title available?)
- scientific article; zbMATH DE number 908788 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- scientific article; zbMATH DE number 3310759 (Why is no real title available?)
- scientific article; zbMATH DE number 3186565 (Why is no real title available?)
- scientific article; zbMATH DE number 3102313 (Why is no real title available?)
- A Chvátal-Erdős condition for Hamilton cycles in digraphs
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- A new sufficient condition for a digraph to be Hamiltonian
- A note on Hamiltonian circuits
- A note on some embedding problems for oriented graphs
- A note on the number of Hamiltonian paths in strong tournaments
- A proof of Sumner's universal tournament conjecture for large tournaments
- A semiexact degree condition for Hamilton cycles in digraphs
- Advances on the Hamiltonian problem -- a survey
- An Ore-type condition implying a digraph to be pancyclic
- An approximate version of Sumner's universal tournament conjecture
- An exact minimum degree condition for Hamilton cycles in oriented graphs
- Arbitrary orientations of Hamilton cycles in oriented graphs
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
- Combinatorial and computational aspects of graph packing and graph decomposition
- Complementary cycles of all lengths in tournaments
- Cycles in digraphs– a survey
- Cycles of given length in oriented graphs
- Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
- Degree conditions for k‐ordered hamiltonian graphs
- Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
- Edge-disjoint Hamilton cycles in graphs
- Finding Hamilton cycles in robustly expanding digraphs
- Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs
- Hamilton Cycles in Oriented Graphs
- Hamilton cycles in highly connected and expanding graphs
- Hamilton cycles in regular 2-connected graphs
- Hamilton decompositions of regular tournaments
- Hamiltonian Cycles in Regular Tournaments
- Hamiltonian degree sequences in digraphs
- Note on Hamilton Circuits
- On Hamilton's ideals
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs
- On the Number of Hamiltonian Cycles in a Tournament
- Onk-ordered Hamiltonian graphs
- Oriented Hamiltonian cycles in tournaments
- Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
- Oriented hamilton cycles in digraphs
- Pancyclic oriented graphs
- Partitioning vertices of a tournament into independent cycles
- Paths and Cycles in Tournaments
- Powers of Hamilton cycles in tournaments
- Proof of the Seymour conjecture for large graphs
- Some Theorems on Abstract Graphs
- Sparse pseudo‐random graphs are Hamiltonian
- Sufficient Conditions for Circuits in Graphs†
- Testing subgraphs in directed graphs
- The maximum number of Hamiltonian paths in tournaments
- Triangle packings and 1-factors in oriented graphs
- Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
- \(k\)-Ordered Hamilton cycles in digraphs
Cited in
(34)- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Edge-disjoint properly colored cycles in edge-colored complete graphs
- A random walk approach to linear statistics in random tournament ensembles
- The robust component structure of dense regular graphs and applications
- Hamilton cycles in dense regular digraphs and oriented graphs
- Hamilton decompositions of regular expanders: applications
- Recent advances on the Hamiltonian problem: survey III
- Hamilton powers of Eulerian digraphs
- An improvement of Lichiardopol's theorem on disjoint cycles in tournaments
- Approximate Hamilton decompositions of robustly expanding regular digraphs
- Tight bounds for powers of Hamilton cycles in tournaments
- A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs
- Hamiltonian problems in directed graphs with simple row patterns
- Oriented discrepancy of Hamilton cycles
- A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph
- A new sufficient condition for a 2-strong digraph to be Hamiltonian
- The ratio of the numbers of odd and even cycles in outerplanar graphs
- Computational complexity of counting coincidences
- A survey: Hamiltonian cycles in Cayley graphs
- Hamilton cycles in sparse robustly expanding digraphs
- Cayley graph associated to a semihypergroup
- Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
- Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
- On the maximum number of spanning copies of an orientation in a tournament
- Counting Hamilton decompositions of oriented graphs
- Properly colored cycles of different lengths in edge-colored complete graphs
- Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs
- A note on the Hamiltonian circuit problem on directed path graphs
- Arbitrary orientations of Hamilton cycles in digraphs
- Transversal Hamilton cycle in hypergraph systems
- Long directed rainbow cycles and rainbow spanning trees
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments
This page was built for publication: A survey on Hamilton cycles in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412269)
