Obligatory hypergraphs
Combinatorics
2024-03-19 v1 Logic
Abstract
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.
Cite
@article{arxiv.2403.11223,
title = {Obligatory hypergraphs},
author = {Christian Reiher},
journal= {arXiv preprint arXiv:2403.11223},
year = {2024}
}
Comments
2 figures