Obligatory hypergraphs
arXiv:2403.11223
Abstract
Erdős and Hajnal proved that every graph of uncountable chromatic number contains arbitrarily large finite, complete, bipartite graphs. We extend this result to hypergraphs.
arXiv comment2 figures
arXiv:2403.11223
Erdős and Hajnal proved that every graph of uncountable chromatic number contains arbitrarily large finite, complete, bipartite graphs. We extend this result to hypergraphs.
arXiv comment2 figures