A consistent edge partition theorem for infinite graphs

DOI10.1007/BF01872104MaRDI QIDQ1332974zbMATH OpenFDO

Authors S. 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

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

Recommendations

• Embedding Graphs into Colored Graphs
• Consistency results on infinite graphs
• NOTES ON SOME ERDŐS–HAJNAL PROBLEMS
• A note on chromatic number and connectivity of infinite graphs
• Generic graph construction
• scientific article; zbMATH DE number 3902684
• Identities on cardinals less than ℵ_ω
• Finite subgraphs of uncountably chromatic graphs
• On Taylor's problem
• scientific article; zbMATH DE number 940707

Cites work

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

Cited in

(15)

• A Ramsey-style extension of a theorem of Erdős and Hajnal
• scientific article; zbMATH DE number 1795293 (Why is no real title available?)
• Colorful Partitions of Cardinal Numbers
• scientific article; zbMATH DE number 3487493 (Why is no real title available?)
• Tree-partitions of infinite graphs
• Embedding theorems for graphs establishing negative partition relations
• NOTES ON SOME ERDŐS–HAJNAL PROBLEMS
• The Erdős-Dushnik-Miller theorem for topological graphs and orders
• Wild edge colourings of graphs
• scientific article; zbMATH DE number 4118372 (Why is no real title available?)
• scientific article; zbMATH DE number 4142066 (Why is no real title available?)
• Constructions of infinite graphs with Ramsey property
• Ramsey theory for highly connected monochromatic subgraphs
• Embedding Graphs into Colored Graphs
• Edge partitions of the countable triangle free homogeneous graph

This page was built for publication: A consistent edge partition theorem for infinite graphs

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