Cycles of length three and four in tournaments

MaRDI QIDQ6621178

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

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The clique density theorem
• Limits of dense graph sequences
• Quick approximation to matrices and applications
• Vraagstuk XXVIII.
• 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

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