The effect of induced subgraphs on quasi-randomness
From MaRDI portal
Publication:3055880
DOI10.1002/RSA.20289zbMath1209.05230arXiv0903.0328OpenAlexW3083653540MaRDI QIDQ3055880
Publication date: 10 November 2010
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.0328
Related Items (11)
A characterization of functions with vanishing averages over products of disjoint sets ⋮ Eigenvalues and extremal degrees of graphs ⋮ σ-algebras for quasirandom hypergraphs ⋮ Quasi-random graphs and graph limits ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ FORCING QUASIRANDOMNESS WITH TRIANGLES ⋮ More on quasi-random graphs, subgraph counts and graph limits ⋮ Quasirandomness in hypergraphs ⋮ Weak quasi-randomness for uniform hypergraphs ⋮ The quasi-randomness of hypergraph cut properties ⋮ The poset of hypergraph quasirandomness
Cites Work
- Unnamed Item
- A variant of the hypergraph removal lemma
- Quasi-randomness and the distribution of copies of a fixed graph
- On a packing and covering problem
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Generalized quasirandom graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Quasi-random tournaments
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Expander graphs and their applications
- Quasirandom Groups
- The Algorithmic Aspects of the Regularity Lemma
- Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs
- Quasi-Random Set Systems
- The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance
- The counting lemma for regular k‐uniform hypergraphs
- A Certain Class of Incidence Matrices
- Quasi-random graphs
This page was built for publication: The effect of induced subgraphs on quasi-randomness
