Chromatic number of finite and infinite graphs and hypergraphs (Q1059084)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3902682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chromatic number of finite and infinite graphs and hypergraphs |
scientific article; zbMATH DE number 3902682 |
Statements
Chromatic number of finite and infinite graphs and hypergraphs (English)
0 references
1985
0 references
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.
0 references
uncountable chromatic number
0 references
bipartite graph
0 references
edge density
0 references
finite graphs
0 references
finite hypergraphs
0 references
infinite hypergraphs
0 references
infinite graphs
0 references
0.9396787
0 references
0 references
0.93596554
0 references
0.9353455
0 references
0 references
0 references
