FORCING QUASIRANDOMNESS WITH TRIANGLES
From MaRDI portal
Publication:4632525
DOI10.1017/fms.2019.7zbMath1409.05187arXiv1711.04754OpenAlexW2770426925MaRDI QIDQ4632525
Christian Reiher, Mathias Schacht
Publication date: 30 April 2019
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.04754
Related Items (5)
Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Quasirandom-Forcing Orientations of Cycles ⋮ A limit theorem for small cliques in inhomogeneous random graphs ⋮ FORCING QUASIRANDOMNESS WITH TRIANGLES ⋮ Quasirandomness in hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
- An approximate version of Sidorenko's conjecture
- Szemerédi's lemma for the analyst
- Quasi-randomness and the distribution of copies of a fixed graph
- On universality of graphs with uniformly distributed edges
- Explicit construction of linear sized tolerant networks
- The number of submatrices of a given type in a Hadamard matrix and related results
- Eigenvalues and expanders
- Quick approximation to matrices and applications
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Hypergraphs, quasi-randomness, and conditions for regularity
- Pseudo-random hypergraphs
- Quasirandom permutations
- Sparse quasi-random graphs
- Bipartite subgraphs and quasi-randomness
- Linear dependence between hereditary quasirandomness conditions
- More on quasi-random graphs, subgraph counts and graph limits
- Finite reflection groups and graph norms
- Extremal results in sparse pseudorandom graphs
- Cyclotomy and difference families in elementary Abelian groups
- Two approaches to Sidorenko’s conjecture
- Quasi-Random Oriented Graphs
- Quasi-randomness of graph balanced cut properties
- σ-algebras for quasirandom hypergraphs
- The effect of induced subgraphs on quasi-randomness
- Weak quasi-randomness for uniform hypergraphs
- Quasi-random hypergraphs revisited
- The quasi-randomness of hypergraph cut properties
- Quasi-random tournaments
- Quasi-random hypergraphs
- Quasirandom Groups
- Szemerédi's partition and quasirandomness
- Quasi‐random classes of hypergraphs
- Regular pairs in sparse random graphs I
- Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs
- Hereditary quasirandomness without regularity
- FORCING QUASIRANDOMNESS WITH TRIANGLES
- Some advances on Sidorenko's conjecture
- Quasi-Random Set Systems
- EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
- Quasi-random graphs
- Quasirandomness in hypergraphs
- Graph norms and Sidorenko's conjecture
This page was built for publication: FORCING QUASIRANDOMNESS WITH TRIANGLES
