Large holes in quasi-random graphs

zbMATH Open1159.05048MaRDI QIDQ1010779FDOQ1010779

Authors: 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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Large holes in sparse random graphs
• Sparse quasi-random graphs
• Quasi-random graphs of given density and Ramsey numbers
• Quasi-randomness and the distribution of copies of a fixed graph
• Quasi-random graphs

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (2)

• The size of the largest hole in a random graph
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010779)