Powers of paths in tournaments

DOI10.1017/S0963548321000067MaRDI QIDQ5886115zbMATH OpenOpenAlexFDO

Authors Nemanja Draganić, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex Scott, Benny Sudakov

Publication date 30 March 2023

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

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

zbMATH Keywords

Hamiltonian pathshortcut

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Powers of Hamilton cycles in tournaments
• About the number of directed paths in tournaments
• scientific article; zbMATH DE number 4089591
• Tight bounds for powers of Hamilton cycles in tournaments
• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture

Cites work

• On maximal paths and circuits of graphs
• Paths with many shortcuts in tournaments
• Powers of Hamilton cycles in tournaments
• Proof of the Seymour conjecture for large graphs
• Some Theorems on Abstract Graphs

Cited in

(13)

• Tight bounds for powers of Hamilton cycles in tournaments
• Paths with many shortcuts in tournaments
• Parity of paths in tournaments
• scientific article; zbMATH DE number 944224 (Why is no real title available?)
• Path numbers of balanced bipartite tournaments
• Path decompositions of tournaments
• Paths of given length in tournaments
• Ramsey numbers of sparse digraphs
• Turán problems for oriented graphs
• Ordered Ramsey numbers of graphs with m edges
• A new perspective from hypertournaments to tournaments
• Blow-ups and extensions of trees in tournaments
• Powers of Hamilton cycles in tournaments

This page was built for publication: Powers of paths in tournaments

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