Connectivity and chromatic number of infinite graphs
Every graph with uncountable chromatic number contains for every finiten ann-connected subgraph with infinite degrees which has uncountable chromatic number.
KeywordsCorrect Order Chromatic Number Compactness Theorem Free Algebra Subgraph Isomorphic
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 4.P. Komjáth,The coloring number, Proc. London Math. Soc., to appear.Google Scholar
© Hebrew University 1986