Paths of given length in tournaments

DOI10.5070/c63261981zbMath1527.05105arXiv2012.00262OpenAlexW4287585631MaRDI QIDQ6179323

Mehtaab Sawhney, Ashwin Sah, Yufei Zhao

Publication date: 16 December 2023

Published in: Combinatorial Theory (Search for Journal in Brave)

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

zbMATH Keywords

pathstournaments

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Supersaturated graphs and hypergraphs
• Cycles of a given length in tournaments
• The maximum number of Hamiltonian paths in tournaments
• A correlation inequality for bipartite graphs
• Impartial digraphs
• On the maximum number of Hamiltonian paths in tournaments
• Sidorenko's conjecture for blow-ups
• Some advances on Sidorenko's conjecture
• The Maximum Number of Strongly Connected Subtournaments^*
• On the Number of Hamiltonian Cycles in a Tournament

This page was built for publication: Paths of given length in tournaments