Tournament quasirandomness from local counting

DOI10.1007/S00493-020-4371-YzbMATH Open1474.05158arXiv1910.09936OpenAlexW3127383814MaRDI QIDQ2036620FDOQ2036620

Benny Sudakov, Eoin Long, Matija Bucić, Asaf Shapira

Publication date: 29 June 2021

Published in: Combinatorica (Search for Journal in Brave)

Abstract: A well-known theorem of Chung and Graham states that if $hgeq4$ then a tournament $T$ is quasirandom if and only if $T$ contains each $h$-vertex tournament the "correct number" of times as a subtournament. In this paper we investigate the relationship between quasirandomness of $T$ and the count of a single $h$-vertex tournament $H$ in $T$. We consider two types of counts, the global one and the local one. We first observe that if $T$ has the correct global count of $H$ and $hgeq7$ then quasirandomness of $T$ is only forced if $H$ is transitive. The next natural question when studying quasirandom objects asks whether possessing the correct local counts of $H$ is enough to force quasirandomness of $T$. A tournament $H$ is said to be locally forcing if it has this property. Variants of the local forcing problem have been studied before in both the graph and hypergraph settings. Perhaps the closest analogue of our problem was considered by Simonovits and S'os who looked at whether having "correct counts" of a fixed graph $H$ as an induced subgraph of $G$ implies $G$ must be quasirandom, in an appropriate sense. They proved that this is indeed the case when $H$ is regular and conjectured that it holds for all $H$ (except the path on 3 vertices). Contrary to the Simonovits-S'os conjecture, in the tournament setting we prove that a constant proportion of all tournaments are not locally forcing. In fact, any locally forcing tournament must itself be strongly quasirandom. On the other hand, unlike the global forcing case, we construct infinite families of non-transitive locally forcing tournaments.

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

Recommendations

• No additional tournaments are quasirandom-forcing
• On the density of transitive tournaments
• Quasi-carousel tournaments
• Quasi-randomness and the distribution of copies of a fixed graph
• Quasi-random tournaments

zbMATH Keywords

forcingtournamentquasi-randomsubtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• On extremal problems of graphs and generalized graphs
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Title not available (Why is that?)
• Regularity Lemma for k-uniform hypergraphs
• The counting lemma for regular k‐uniform hypergraphs
• Testing subgraphs in directed graphs
• Title not available (Why is that?)
• Analysis of Boolean Functions
• Quasi-random graphs
• Algorithms in real algebraic geometry
• The probabilistic method
• Title not available (Why is that?)
• Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
• Weak quasi-randomness for uniform hypergraphs
• Title not available (Why is that?)
• Quasirandom Groups
• Title not available (Why is that?)
• Quasirandom permutations are characterized by 4-point densities
• Quasi-Random Set Systems
• Optimal ranking of tournaments
• On the maximum cardinality of a consistent set of arcs in a random tournament
• Algorithms with large domination ratio
• Quasirandom permutations
• Quasi-random tournaments
• Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs
• Hereditary quasirandom properties of hypergraphs
• On the Density of Transitive Tournaments
• On the maximum number of Hamiltonian paths in tournaments
• Quasi-random oriented graphs
• On the maximum density of fixed strongly connected subtournaments
• A Note on Even Cycles and Quasirandom Tournaments
• Hereditary quasirandomness without regularity

Cited In (7)

• No additional tournaments are quasirandom-forcing
• Characterization of quasirandom permutations by a pattern sum
• Quasirandom-Forcing Orientations of Cycles
• Forcing generalised quasirandom graphs efficiently
• Cycles of a given length in tournaments
• Lower bound on the size of a quasirandom forcing set of permutations
• Quasirandom Latin squares

This page was built for publication: Tournament quasirandomness from local counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2036620)