On the Maximum Number of Spanning Copies of an Orientation in a Tournament

DOI10.1017/S0963548317000153zbMath1371.05111arXiv1511.07784OpenAlexW2963826071MaRDI QIDQ5366972

Raphael Yuster

Publication date: 10 October 2017

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

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

zbMATH Keywords

directed Hamilton cycle\(n\)-vertex tournament

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Problems and results in extremal combinatorics. III.
• Counting and packing Hamilton cycles in dense graphs and oriented graphs
• A survey on Hamilton cycles in directed graphs
• On a packing and covering problem
• The maximum number of Hamiltonian paths in tournaments
• On the maximum number of Hamiltonian paths in tournaments
• Hamiltonian Cycles in Regular Tournaments
• On the Number of Hamiltonian Cycles in a Tournament
• On the maximal number of independent circuits in a graph

This page was built for publication: On the Maximum Number of Spanning Copies of an Orientation in a Tournament