Cycles of length three and four in tournaments
From MaRDI portal
Publication:6621178
Recommendations
Cites Work
- scientific article; zbMATH DE number 3821782 (Why is no real title available?)
- scientific article; zbMATH DE number 3508542 (Why is no real title available?)
- scientific article; zbMATH DE number 1235881 (Why is no real title available?)
- Asymptotic structure of graphs with the minimum number of triangles
- Large networks and graph limits
- Limits of dense graph sequences
- Lower bounds on the number of triangles in a graph
- On Sets of Acquaintances and Strangers at any Party
- On the Minimal Density of Triangles in Graphs
- On the characteristic roots of tournament matrices
- On the number of 4-cycles in a tournament
- Quasi-random tournaments
- Quick approximation to matrices and applications
- The clique density theorem
- The number of cliques in graphs of given order and size
- 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)