Chromatic number of finite and infinite graphs and hypergraphs

DOI10.1016/0012-365X(85)90148-7zbMath0566.05029MaRDI QIDQ1059084

Paul Erdős, Andras Hajnal

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphinfinite graphsfinite graphsedge densityuncountable chromatic numberfinite hypergraphsinfinite hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15)

Related Items

The $\chi$-Ramsey Problem for Triangle-Free Graphs, Consistency results on infinite graphs, Bipartite induced density in triangle-free graphs, Bounds for chromatic number in terms of even-girth and booksize, Forcing constructions for uncountably chromatic graphs, Trees, ladders and graphs, Prime orientable graphs, Editing to prime graphs

Cites Work

• What must and what need not be contained in a graph of uncountable chromatic number?
• A note on Ramsey numbers
• Graph Theory and Probability. II
• On chromatic number of graphs and set-systems
• Unnamed Item
• Unnamed Item