A note on chromatic number and connectivity of infinite graphs

DOI10.1007/S11856-012-0176-ZzbMATH Open1275.05040OpenAlexW2013589923MaRDI QIDQ375903FDOQ375903

Péter Komjáth

Publication date: 1 November 2013

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

Full work available at URL: https://doi.org/10.1007/s11856-012-0176-z

zbMATH Keywords

uncountably chromatic graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Infinite graphs (05C63)

Cites Work

• Consistency results on infinite graphs
• On chromatic number of graphs and set-systems
• A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
• Connectivity and chromatic number of infinite graphs
• Partition Relations Connected with the Chromatic Number of Graphs
• A Negative Partition Relation

Cited In (11)

• The role of the Axiom of Choice in proper and distinguishing colourings
• Connectivity and chromatic number of infinite graphs
• Title not available (Why is that?)
• The chromatic number of infinite graphs - A survey
• NOTES ON SOME ERDŐS–HAJNAL PROBLEMS
• On the connectivity of infinite graphs
• Consistency results on infinite graphs
• A consistent edge partition theorem for infinite graphs
• Trees, ladders and graphs
• The list-chromatic number of infinite graphs defined on Euclidean spaces
• Infinitely connected subgraphs in graphs of uncountable chromatic number

This page was built for publication: A note on chromatic number and connectivity of infinite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q375903)