Cycles of length three and four in tournaments
From MaRDI portal
Publication:6621178
Authors: T. F. N. Chan, A. Grzesik, Daniel Král', Jonathan A. Noel
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
Recommendations
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Paths and cycles (05C38)
Cites Work
- Limits of dense graph sequences
- Large networks and graph limits
- Title not available (Why is that?)
- The number of cliques in graphs of given order and size
- Lower bounds on the number of triangles in a graph
- On Sets of Acquaintances and Strangers at any Party
- Quick approximation to matrices and applications
- The clique density theorem
- On the Minimal Density of Triangles in Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the characteristic roots of tournament matrices
- Asymptotic structure of graphs with the minimum number of triangles
- On the number of 4-cycles in a tournament
- Quasi-random tournaments
- Vraagstuk XXVIII.
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)