Erd os--Hajnal problem for H-free hypergraphs
Abstract
This paper deals with the minimum number mH(r) of edges in an H-free graph with the chromatic number more than r. We show how bounds on Ramsey and Tur\'an numbers imply bounds on mH(r).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.