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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。