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

On the connectivity of infinite graphs

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

DOI10.1007/S10474-017-0752-0zbMath1413.03010OpenAlexW2754433061MaRDI QIDQ1705205

Péter Komjáth

Publication date: 14 March 2018

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10474-017-0752-0


zbMATH Keywords

connectivityinfinite graphchromatic number


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05) Connectivity (05C40) Partition relations (03E02) Infinite graphs (05C63)


Related Items (1)

Ramsey theory for highly connected monochromatic subgraphs




Cites Work

  • A note on chromatic number and connectivity of infinite graphs
  • Trees, ladders and graphs
  • Consistency results on infinite graphs
  • Connectivity and chromatic number of infinite graphs
  • A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
  • The Colouring Number




This page was built for publication: On the connectivity of infinite graphs

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