
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.
2 figures
FOS: Mathematics, Mathematics - Combinatorics, Mathematics - Logic, Combinatorics (math.CO), Logic (math.LO), 03E05, 05C15, 05D10
FOS: Mathematics, Mathematics - Combinatorics, Mathematics - Logic, Combinatorics (math.CO), Logic (math.LO), 03E05, 05C15, 05D10
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
