On the Number of 4-Cycles in a Tournament

DOI10.1002/jgt.21996zbMath1350.05051arXiv1405.1576OpenAlexW1619586052MaRDI QIDQ2833121

Avraham Morgenstern, Nathan Linial

Publication date: 16 November 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

tournamentsextremal combinatoricslocal graph theorysmall cycles in tournaments

Mathematics Subject Classification ID

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

Related Items (7)

Minimizing cycles in tournaments and normalized \(q\)-norms ⋮ Inducibility and universality for trees ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ A note on the inducibility of 4-vertex graphs ⋮ Cycles of length three and four in tournaments ⋮ Entropy of tournament digraphs ⋮ Generalized tournament matrices with the same principal minors

Uses Software

• CVX

Cites Work

• The number of cliques in graphs of given order and size
• On the Local Profiles of Trees
• On the Minimal Density of Triangles in Graphs
• Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal
• Flag algebras
• On the 3‐Local Profiles of Graphs

This page was built for publication: On the Number of 4-Cycles in a Tournament