On the Density of Transitive Tournaments

DOI10.1002/jgt.22044zbMath1437.05086arXiv1501.04074OpenAlexW1561387090MaRDI QIDQ5272630

Leonardo Nagami Coregliano, Alexander A. Razborov

Publication date: 30 June 2017

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

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

zbMATH Keywords

tournamentflag algebraquasirandom

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20) Extremal combinatorics (05D99)

Related Items

Lower bound on the size of a quasirandom forcing set of permutations, Impartial digraphs, Quasirandom-Forcing Orientations of Cycles, Natural quasirandomness properties, Quasirandom Latin squares, The codegree threshold of \(K_4^-\), On the maximum density of fixed strongly connected subtournaments, Tournament quasirandomness from local counting, On explicit random-like tournaments, Characterization of quasirandom permutations by a pattern sum, Decomposing Graphs into Edges and Triangles, Compactness and finite forcibility of graphons, Inducibility of directed paths, Cycles of a given length in tournaments, No additional tournaments are quasirandom-forcing

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs containing triangles are not 3-common
• Multiplicities of subgraphs
• Quasi-Random Oriented Graphs
• On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs
• Non-Three-Colourable Common Graphs Exist
• WHAT IS... a Flag Algebra?
• Quasi-random tournaments
• Graph limits and exchangeable random graphs
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• On the Ramsey multiplicities of graphs—problems and recent results
• A Note on Even Cycles and Quasirandom Tournaments
• Flag algebras
• Quasi-random graphs