Powers of Hamilton cycles in tournaments

DOI10.1016/0095-8956(90)90085-EMaRDI QIDQ923097zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Roland Häggkvist

Publication date 1990

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(90)90085-e

zbMATH Keywords

Hamilton cycletournamentdegrees

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Tight bounds for powers of Hamilton cycles in tournaments
• Powers of paths in tournaments
• Pancyclic in-tournaments
• scientific article; zbMATH DE number 969987
• scientific article; zbMATH DE number 4089591

Cites work

• scientific article; zbMATH DE number 3265668 (Why is no real title available?)
• Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
• Long paths and cycles in oriented graphs
• On extremal problems of graphs and generalized graphs

Cited in

(11)

• Paths with many shortcuts in tournaments
• Tight bounds for powers of Hamilton cycles in tournaments
• A survey on Hamilton cycles in directed graphs
• Hamiltonian degree sequences in digraphs
• Tournaments and Semicomplete Digraphs
• Hamiltonian Cycles in Regular Tournaments
• A note on some embedding problems for oriented graphs
• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
• On the longest path of a randomly weighted tournament
• Powers of paths in tournaments
• A Dirac-Type Result on Hamilton Cycles in Oriented Graphs

This page was built for publication: Powers of Hamilton cycles in tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q923097)