Trees, ladders and graphs

DOI10.1016/j.jctb.2015.05.004zbMath1319.05041arXiv1409.2922OpenAlexW2167749725MaRDI QIDQ490986

Dániel T. Soukup

Publication date: 21 August 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.2922

zbMATH Keywords

ladder systemconnected subgraphnon-special treeuncountably chromatic

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

On the connectivity of infinite graphs ⋮ Infinitely connected subgraphs in graphs of uncountable chromatic number ⋮ INFINITE COMBINATORICS PLAIN AND SIMPLE ⋮ Ramsey theory for highly connected monochromatic subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on chromatic number and connectivity of infinite graphs
• What must and what need not be contained in a graph of uncountable chromatic number?
• Chromatic number of finite and infinite graphs and hypergraphs
• Consistency results on infinite graphs
• Connectivity and chromatic number of infinite graphs
• The chromatic number of infinite graphs - A survey
• Ladder systems on trees
• Partition Relations Connected with the Chromatic Number of Graphs
• Graph Theory and Probability
• Forcing constructions for uncountably chromatic graphs
• Erdős’s Work on Infinite Graphs
• On chromatic number of graphs and set-systems
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Trees, ladders and graphs