Infinitely connected subgraphs in graphs of uncountable chromatic number
Sign Up to like & getrecommendations! Published in 2017 at "Combinatorica"
DOI: 10.1007/s00493-016-3436-4
Abstract: Erdős and Hajnal conjectured in 1966 that every graph of uncountable chromatic number contains a subgraph of infinite connectivity. We prove that every graph of uncountable chromatic number has a subgraph which has uncountable chromatic… read more here.
Keywords: connected subgraphs; uncountable chromatic; subgraphs graphs; infinitely connected ... See more keywords