Consistency results on infinite graphs

DOI10.1007/BF02772573zbMath0668.05031OpenAlexW2069003332WikidataQ60680298 ScholiaQ60680298MaRDI QIDQ1117946

Péter Komjáth

Publication date: 1988

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02772573

zbMATH Keywords

infinite graphRamsey ultrafilterproper forcing axiom\(\omega\)- connected subgraphcountably chromatic

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Chromatic numbers of graphs -- large gaps ⋮ A note on chromatic number and connectivity of infinite graphs ⋮ In memoriam: James Earl Baumgartner (1943--2011) ⋮ On the connectivity of infinite graphs ⋮ Trees, ladders and graphs ⋮ The chromatic number of infinite graphs - A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic number of finite and infinite graphs and hypergraphs
• Some downwards transfer properties for \(\aleph _ 2\)
• Connectivity and chromatic number of infinite graphs
• Problems and results on finite and infinite combinatorial analysis. II
• On the combinatorial problems which I would most like to see solved
• Proper forcing
• A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
• Chromatic numbers of subgraphs
• Generic graph construction
• Forcing constructions for uncountably chromatic graphs
• Potent Axioms
• On chromatic number of graphs and set-systems

This page was built for publication: Consistency results on infinite graphs