A consistent edge partition theorem for infinite graphs

DOI10.1007/BF01872104zbMath0823.03025MaRDI QIDQ1332974

Saharon Shelah, Péter Komjáth

Publication date: 5 September 1994

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

zbMATH Keywords

consistencyinfinite graphpartition relation

Mathematics Subject Classification ID

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

Cites Work

• Coloring of universal graphs
• Embedding finite graphs into graphs colored with infinitely many colors
• Partitionstheoreme für Graphen
• The Ramsey property for graphs with forbidden complete subgraphs
• Partitions of finite relational and set systems
• A partition calculus in set theory
• Embedding Graphs into Colored Graphs
• On decomposition of graphs
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring