Cycles of length three and four in tournaments

DOI10.1016/j.jcta.2020.105276zbMath1442.05073arXiv1902.00572OpenAlexW2981264517MaRDI QIDQ778712

Andrzej Grzesik, Jonathan A. Noel, Timothy F. N. Chan, Daniel Král'

Publication date: 3 July 2020

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

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

zbMATH Keywords

cyclestournamentsextremal combinatorics

Mathematics Subject Classification ID

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

Related Items (4)

Minimizing cycles in tournaments and normalized \(q\)-norms ⋮ Inducibility and universality for trees ⋮ Quasirandom-Forcing Orientations of Cycles ⋮ Cycles of a given length in tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The clique density theorem
• Limits of dense graph sequences
• Quick approximation to matrices and applications
• On the Number of 4-Cycles in a Tournament
• The number of cliques in graphs of given order and size
• On Sets of Acquaintances and Strangers at any Party
• Quasi-random tournaments
• On the Minimal Density of Triangles in Graphs
• Lower bounds on the number of triangles in a graph
• Asymptotic Structure of Graphs with the Minimum Number of Triangles
• On the characteristic roots of tournament matrices

This page was built for publication: Cycles of length three and four in tournaments