Bipartite subgraphs and quasi-randomness
From MaRDI portal
Publication:1889833
DOI10.1007/s00373-004-0556-1zbMath1054.05091MaRDI QIDQ1889833
Publication date: 13 December 2004
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-004-0556-1
05C35: Extremal problems in graph theory
05C80: Random graphs (graph-theoretic aspects)
60C05: Combinatorial probability
Related Items
Hereditary quasirandomness without regularity, FORCING QUASIRANDOMNESS WITH TRIANGLES, Quasirandom Graphs and the Pantograph Equation, The poset of hypergraph quasirandomness, Constructive Packings by Linear Hypergraphs, Quasirandomness in hypergraphs, On tripartite common graphs, Quasirandom-Forcing Orientations of Cycles, An approximate version of Sidorenko's conjecture, The step Sidorenko property and non-norming edge-transitive graphs, No additional tournaments are quasirandom-forcing, Cut distance identifying graphon parameters over weak* limits, σ-algebras for quasirandom hypergraphs, Weak quasi-randomness for uniform hypergraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems