Chromatic number of finite and infinite graphs and hypergraphs
From MaRDI portal
(Redirected from Publication:1059084)
In this survey the authors state some old and new solved and unsolved problems concerning the chromatic number of finite and infinite graphs and hypergraphs, raised by Galvin, Shelah, Komlós, Komjath, Mihoc, Burr, Szemerédi, Nešetřil, Rödl, Taylor and the authors.
Recommendations
- scientific article; zbMATH DE number 3262991
- scientific article; zbMATH DE number 3914342
- scientific article; zbMATH DE number 528072
- The chromatic number of infinite graphs - A survey
- Chromatic numbers in some graphs
- SPECTRA AND CHROMATIC NUMBERS OF INFINITE GRAPHS
- Connectivity and chromatic number of infinite graphs
- On the chromatic number of graphs
- scientific article; zbMATH DE number 4085672
- On chromaticity of hypergraphs
Cites work
- A note on Ramsey numbers
- Graph Theory and Probability. II
- scientific article; zbMATH DE number 3788655 (Why is no real title available?)
- scientific article; zbMATH DE number 3262991 (Why is no real title available?)
- On chromatic number of graphs and set-systems
- What must and what need not be contained in a graph of uncountable chromatic number?
Cited in
(20)- Consistency results on infinite graphs
- Connectivity and chromatic number of infinite graphs
- Editing to prime graphs
- Bipartite induced density in triangle-free graphs
- Prime orientable graphs
- scientific article; zbMATH DE number 3914342 (Why is no real title available?)
- scientific article; zbMATH DE number 4039909 (Why is no real title available?)
- Forcing constructions for uncountably chromatic graphs
- scientific article; zbMATH DE number 1779834 (Why is no real title available?)
- SPECTRA AND CHROMATIC NUMBERS OF INFINITE GRAPHS
- Trees, ladders and graphs
- scientific article; zbMATH DE number 1406332 (Why is no real title available?)
- The -Ramsey problem for triangle-free graphs
- Chromatic numbers in some graphs
- Bounds for chromatic number in terms of even-girth and booksize
- The list-chromatic number of infinite graphs defined on Euclidean spaces
- Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
- Random independent sets in triangle-free graphs
- A note on uncountably chromatic graphs
- Set systems with finite chromatic number
This page was built for publication: Chromatic number of finite and infinite graphs and hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1059084)