No additional tournaments are quasirandom-forcing

DOI10.1016/j.ejc.2022.103632zbMath1504.05106arXiv1912.04243OpenAlexW2991990030MaRDI QIDQ2107498

Daniel Král', Jan Volec, Robert Hancock, Fiona Skerman, Adam Kabela, Roberto F. Parente, Taísa L. Martins

Publication date: 1 December 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

random tournamentnon-transitive 5-vertex tournament

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (4)

Lower bound on the size of a quasirandom forcing set of permutations ⋮ Quasirandom-Forcing Orientations of Cycles ⋮ Cycles of a given length in tournaments ⋮ No additional tournaments are quasirandom-forcing

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximate version of Sidorenko's conjecture
• On universality of graphs with uniformly distributed edges
• Quasi-random subsets of \(\mathbb{Z}_ n\)
• Hypergraphs, quasi-randomness, and conditions for regularity
• On the maximum density of fixed strongly connected subtournaments
• Pseudo-random hypergraphs
• Quasirandom permutations
• Bipartite subgraphs and quasi-randomness
• Tournament quasirandomness from local counting
• No additional tournaments are quasirandom-forcing
• Quasirandom permutations are characterized by 4-point densities
• Decomposition of tournament limits
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Impartial digraphs
• Quasi-random tournaments
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Characterization of quasirandom permutations by a pattern sum
• Quasi-random hypergraphs
• Quasirandom Groups
• Graph limits and exchangeable random graphs
• Quasi-Random Set Systems
• Regularity Lemma for k-uniform hypergraphs
• On the Density of Transitive Tournaments
• The Maximum Number of Strongly Connected Subtournaments^*
• The counting lemma for regular k‐uniform hypergraphs
• A Constructive Solution to a Tournament Problem
• Asymmetric graphs
• Quasi-random graphs

This page was built for publication: No additional tournaments are quasirandom-forcing