No additional tournaments are quasirandom-forcing
From MaRDI portal
Publication:2107498
Abstract: A tournament H is quasirandom-forcing if the following holds for every sequence (G_n) of tournaments of growing orders: if the density of H in G_n converges to the expected density of H in a random tournament, then (G_n) is quasirandom. Every transitive tournament with at least 4 vertices is quasirandom-forcing, and Coregliano et al. [Electron. J. Combin. 26 (2019), P1.44] showed that there is also a non-transitive 5-vertex tournament with the property. We show that no additional tournament has this property. This extends the result of Bucic et al. [Combinatorica 41 (2021), 175-208] that the non-transitive tournaments with seven or more vertices do not have this property.
Recommendations
- Quasi-random tournaments
- On explicit random-like tournaments
- Tournament quasirandomness from local counting
- Equations of tournaments are not finitely based
- scientific article; zbMATH DE number 7300409
- scientific article; zbMATH DE number 3916313
- A note on even cycles and quasirandom tournaments
- Publication:3496355
- Nearly-acyclically pushable tournaments
Cites work
- scientific article; zbMATH DE number 4027516 (Why is no real title available?)
- scientific article; zbMATH DE number 4099367 (Why is no real title available?)
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 3194323 (Why is no real title available?)
- A Constructive Solution to a Tournament Problem
- An approximate version of Sidorenko's conjecture
- Asymmetric graphs
- Bipartite subgraphs and quasi-randomness
- Characterization of quasirandom permutations by a pattern sum
- Decomposition of tournament limits
- Graph limits and exchangeable random graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hypergraphs, quasi-randomness, and conditions for regularity
- Impartial digraphs
- Large networks and graph limits
- No additional tournaments are quasirandom-forcing
- On the density of transitive tournaments
- On the maximum density of fixed strongly connected subtournaments
- On universality of graphs with uniformly distributed edges
- Pseudo-random hypergraphs
- Quasi-Random Set Systems
- Quasi-random graphs
- Quasi-random hypergraphs
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- Quasi-random tournaments
- Quasirandom Groups
- Quasirandom permutations
- Quasirandom permutations are characterized by 4-point densities
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Regularity Lemma for k-uniform hypergraphs
- The Maximum Number of Strongly Connected Subtournaments*
- The counting lemma for regular k‐uniform hypergraphs
- Tournament quasirandomness from local counting
Cited in
(11)- On explicit random-like tournaments
- Lower bound on the size of a quasirandom forcing set of permutations
- Tournament quasirandomness from local counting
- Quasi-carousel tournaments
- On the density of transitive tournaments
- Forcing quasirandomness with triangles
- Quasirandom-Forcing Orientations of Cycles
- A note on even cycles and quasirandom tournaments
- Forcing generalised quasirandom graphs efficiently
- Cycles of a given length in tournaments
- No additional tournaments are quasirandom-forcing
This page was built for publication: No additional tournaments are quasirandom-forcing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107498)
