Monocolored topological complete graphs in colorings of uncountable complete graphs

DOI10.1007/S10474-020-01125-3zbMATH Open1488.03031OpenAlexW3126218314MaRDI QIDQ822604FDOQ822604

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

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

zbMATH Keywords

forcingpartition relationSuslin tree

Mathematics Subject Classification ID

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

Cites Work

• The fine structure of the constructible hierarchy
• Title not available (Why is that?)
• On non-denumerable graphs
• Title not available (Why is that?)
• An \(\aleph_1\)-dense ideal on \(\aleph_2\)
• Zusammenzüge und Unterteilungen von Graphen

Cited In (2)

• More Ramsey theory for highly connected monochromatic subgraphs
• The Erdős-Dushnik-Miller theorem for topological graphs and orders

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)