An uncountably chromatic triple system

DOI10.1007/s10474-008-7179-6zbMath1199.03030OpenAlexW2088885428MaRDI QIDQ1046824

Péter Komjáth

Publication date: 29 December 2009

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

Full work available at URL: https://doi.org/10.1007/s10474-008-7179-6

zbMATH Keywords

forcingchromatic numberinfinite graphs

Mathematics Subject Classification ID

Consistency and independence results (03E35) Coloring of graphs and hypergraphs (05C15) Triple systems (05B07) Other combinatorial set theory (03E05)

Uses Software

• SCHOL

Cites Work

• Unnamed Item
• Obligatory subsystems of triple systems
• A partition calculus in set theory
• Partition Relations Connected with the Chromatic Number of Graphs
• Graph Theory and Probability
• On chromatic number of graphs and set-systems
• Some remarks on obligatory subsystems of uncountably chromatic triple systems

This page was built for publication: An uncountably chromatic triple system