Tournament quasirandomness from local counting

DOI10.1007/s00493-020-4371-yzbMath1474.05158arXiv1910.09936OpenAlexW3127383814MaRDI QIDQ2036620

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

Publication date: 29 June 2021

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

forcingtournamentquasi-randomsubtournament

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) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (6)

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

Cites Work

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

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