Connectivity and chromatic number of infinite graphs
type: Item
instance of: scholarly article
title: Connectivity and chromatic number of infinite graphs
zbMATH Open document ID: 0673.05035
DOI: 10.1007/BF02782936
author: Péter Komjáth
published in: Israel Journal of Mathematics
publication date: 1986-01-01T00:00:00Z
review text: It is proved that for every positive integer n, a graph of uncountable chromatic number contains an n-connected subgraph H of uncountable chromatic number such that every vertex of H has infinite degree in H.
reviewed by: W. Mader
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 4101219
zbMATH Keywords: infinite graphs
zbMATH Keywords: uncountable chromatic number
MaRDI profile type: Publication
cites work: On Shelah's compactness of cardinals
cites work: On chromatic number of graphs and set-systems
cites work: In singular cardinality, locally free algebras are free
cites work: Two remarks on the coloring number
cites work: Q5768776
cites work: A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
full work available at URL: https://doi.org/10.1007/bf02782936
OpenAlex ID: W1987592722
Recommended article: A note on chromatic number and connectivity of infinite graphs
Recommended article: Q5548831
Recommended article: Infinitely connected subgraphs in graphs of uncountable chromatic number
Recommended article: On the connectivity of infinite graphs
Recommended article: Chromatic number of finite and infinite graphs and hypergraphs
Recommended article: The chromatic connectivity of graphs
Recommended article: SPECTRA AND CHROMATIC NUMBERS OF INFINITE GRAPHS
Recommended article: The chromatic number of infinite graphs - A survey
Recommended article: Q4285228
Recommended article: Q3614482
description: scientific article; zbMATH DE number 4101219