Large holes in quasi-random graphs

zbMath1159.05048MaRDI QIDQ1010779

Joanna Polcyn

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129773

zbMATH Keywords

density of large subsetslargest size empty subgraphslargest size of complete bipartite induced subgraphsquasi random graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items (1)

Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs

This page was built for publication: Large holes in quasi-random graphs