Quasirandom-Forcing Orientations of Cycles
From MaRDI portal
Publication:6071821
DOI10.1137/23M1548700zbMath1527.05078arXiv2212.09343MaRDI QIDQ6071821
Bartłomiej Kielak, Andrzej Grzesik, Unnamed Author, Daniel Král'
Publication date: 29 November 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.09343
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximate version of Sidorenko's conjecture
- Cycles of length three and four in tournaments
- 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
- Cycles of a given length in tournaments
- No additional tournaments are quasirandom-forcing
- Partial associativity and rough approximate groups
- Quasirandom permutations are characterized by 4-point densities
- Decomposition of tournament limits
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Impartial digraphs
- Weak quasi-randomness for uniform hypergraphs
- Quasi-random tournaments
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Characterization of quasirandom permutations by a pattern sum
- Quasi-random hypergraphs
- Quasirandom Groups
- On the Number of 5‐Cycles in a Tournament
- FORCING QUASIRANDOMNESS WITH TRIANGLES
- 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
- ON THE METHOD OF PAIRED COMPARISONS
- Lower bound on the size of a quasirandom forcing set of permutations
- Quasi-random graphs
- Transversals in quasirandom latin squares
- Natural quasirandomness properties
- Quasirandom Latin squares
This page was built for publication: Quasirandom-Forcing Orientations of Cycles
