Monocolored topological complete graphs in colorings of uncountable complete graphs

DOI10.1007/S10474-020-01125-3MaRDI QIDQ822604zbMATH OpenOpenAlexFDO

Authors S. Shelah, Péter Komjáth

Publication date 22 September 2021

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

Full work available at URL https://doi.org/10.1007/s10474-020-01125-3

zbMATH Keywords

forcingpartition relationSuslin tree

Mathematics Subject Classification ID

Partition relations (03E02) Consistency and independence results (03E35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Consistency results on infinite graphs
• Embedding Graphs into Colored Graphs
• scientific article; zbMATH DE number 426350
• The Colouring Number
• Monochromatic trees with respect to edge partitions

Cites work

• An \(\aleph_1\)-dense ideal on \(\aleph_2\)
• scientific article; zbMATH DE number 3861143 (Why is no real title available?)
• scientific article; zbMATH DE number 3204304 (Why is no real title available?)
• On non-denumerable graphs
• The fine structure of the constructible hierarchy
• Zusammenzüge und Unterteilungen von Graphen

Cited in

(4)

• The Erdős-Dushnik-Miller theorem for topological graphs and orders
• Residual properties of simple graphs
• More Ramsey theory for highly connected monochromatic subgraphs
• The Erdős-Hajnal problem list

This page was built for publication: Monocolored topological complete graphs in colorings of uncountable complete graphs

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