What must and what need not be contained in a graph of uncountable chromatic number?

DOI10.1007/BF02579156zbMath0541.05026OpenAlexW2087986857MaRDI QIDQ794660

Péter Komjáth, Andras Hajnal

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579156

zbMATH Keywords

chromatic numbercomplete bipartite graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05)

Related Items (9)

Infinite stable graphs with large chromatic number ⋮ SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY ⋮ On Taylor's problem ⋮ Forcing constructions for uncountably chromatic graphs ⋮ Trees, ladders and graphs ⋮ Infinitely connected subgraphs in graphs of uncountable chromatic number ⋮ The chromatic number of infinite graphs - A survey ⋮ Semialgebraic graphs having countable list-chromatic numbers ⋮ Chromatic number of finite and infinite graphs and hypergraphs

Cites Work

• Cycles in graphs of uncountable chromatic number
• Graph Theory and Probability
• A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• Sur le coloriage des graphs

This page was built for publication: What must and what need not be contained in a graph of uncountable chromatic number?