Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A note on chromatic number and connectivity of infinite graphs

From MaRDI portal
Publication:375903
Jump to:navigation, search

DOI10.1007/s11856-012-0176-zzbMath1275.05040OpenAlexW2013589923MaRDI QIDQ375903

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)


Related Items (4)

On the connectivity of infinite graphs ⋮ Trees, ladders and graphs ⋮ Infinitely connected subgraphs in graphs of uncountable chromatic number ⋮ The chromatic number of infinite graphs - A survey



Cites Work

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


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:375903&oldid=12248028"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki