Bipartite subgraphs and quasi-randomness

DOI10.1007/s00373-004-0556-1zbMath1054.05091OpenAlexW2094884500MaRDI QIDQ1889833

Lubos Thoma, Jozef Skokan

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

zbMATH Keywords

bipartite graphpseudorandom graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (15)

Cut distance identifying graphon parameters over weak* limits ⋮ On tripartite common graphs ⋮ The step Sidorenko property and non-norming edge-transitive graphs ⋮ Hereditary quasirandomness without regularity ⋮ An approximate version of Sidorenko's conjecture ⋮ σ-algebras for quasirandom hypergraphs ⋮ Quasirandom-Forcing Orientations of Cycles ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ FORCING QUASIRANDOMNESS WITH TRIANGLES ⋮ Constructive Packings by Linear Hypergraphs ⋮ Quasirandomness in hypergraphs ⋮ Weak quasi-randomness for uniform hypergraphs ⋮ Quasirandom Graphs and the Pantograph Equation ⋮ No additional tournaments are quasirandom-forcing ⋮ The poset of hypergraph quasirandomness

This page was built for publication: Bipartite subgraphs and quasi-randomness