Hajnal-Máté graphs, Cohen reals, and disjoint-type guessing

DOI10.1112/mtk.12261MaRDI QIDQ6581860

Dávid Uhrik, Chris Lambie-Hanson

Publication date: 1 August 2024

Published in: Mathematika (Search for Journal in Brave)

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other combinatorial set theory (03E05) Infinite graphs (05C63)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trees, ladders and graphs
• What must and what need not be contained in a graph of uncountable chromatic number?
• Can you take Solovay's inaccessible away?
• Set theory. An introduction to independence proofs
• Extremal triangle-free and odd-cycle-free colourings of uncountable graphs
• On the growth rate of chromatic numbers of finite subgraphs
• Forcing constructions for uncountably chromatic graphs
• Adding a random or a Cohen real: topological consequences and the effect on Martin's axiom
• Finite subgraphs of uncountably chromatic graphs
• On chromatic number of graphs and set-systems
• On the Consistency Strength of MM($\omega_1$)

This page was built for publication: Hajnal-Máté graphs, Cohen reals, and disjoint-type guessing