A note on uncountable chordal graphs

DOI10.1016/J.DISC.2015.03.022zbMATH Open1311.05136OpenAlexW2065539231MaRDI QIDQ2344784FDOQ2344784

Authors: Péter Komjáth 

Publication date: 18 May 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.03.022

Recommendations

• What must and what need not be contained in a graph of uncountable chromatic number?
• Chromatic numbers of graphs -- large gaps
• Connectivity and chromatic number of infinite graphs
• Consistency results on infinite graphs
• Forcing constructions for uncountably chromatic graphs

zbMATH Keywords

chromatic numberchordal graphsinfinite graphscoloring numberstationary setsregular cardinals

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63)

Cites Work

• Incidence matrices and interval graphs
• A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
• On chromatic number of graphs and set-systems
• Title not available (Why is that?)
• Axiomatic Treatment of Rank in Infinite Sets
• Title not available (Why is that?)
• A note on infinite triangulated graphs
• Infinite triangulated graphs
• Title not available (Why is that?)

Cited In (6)

• The countable character of uncountable graphs
• Characterizing k-chordal unichord-free graphs
• Coloring the power graph of a semigroup
• Hadwiger's conjecture for uncountable graphs
• Maximal independent sets, variants of chain/antichain principle and cofinal subsets without AC
• A note on minors of uncountable graphs

This page was built for publication: A note on uncountable chordal graphs

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