For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set

DOI10.1002/rsa.20488zbMath1302.05116MaRDI QIDQ6486798

Colin J. H. McDiarmid, Ross J. Kang, Bruce A. Reed, Alexander D. Scott

Publication date: 17 November 2014

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

zbMATH Keywords

hypergraphsfinite graphsRamsey-type problems\(r\)-partitions

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Hypergraphs (05C65) Generalized Ramsey theory (05C55)

This page was built for publication: For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set