Prefer a chat interface with context about you and your work?
Obligatory hypergraphs
Erd\H{o}s and Hajnal proved that every graph of uncountable chromatic number contains arbitrarily large finite, complete, bipartite graphs. We extend this result to hypergraphs.