The Erdős-Dushnik-Miller theorem for topological graphs and orders

DOI10.1007/BF00383601MaRDI QIDQ1063007zbMATH OpenOpenAlexFDO

Authors Eric C. Milner, Maurice Pouzet

Publication date 1985

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00383601

zbMATH Keywords

topological spaceindependent settopological graphcomplete graphcomparability graph

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other combinatorial set theory (03E05) Graph theory (05C99)

Recommendations

• Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
• Monocolored topological complete graphs in colorings of uncountable complete graphs
• scientific article; zbMATH DE number 15461
• A GCH Example of an Ordinal Graph with no Infinite Path
• A consistent edge partition theorem for infinite graphs

Cites work

• scientific article; zbMATH DE number 3112450 (Why is no real title available?)
• scientific article; zbMATH DE number 3652325 (Why is no real title available?)
• scientific article; zbMATH DE number 3213310 (Why is no real title available?)
• scientific article; zbMATH DE number 3299769 (Why is no real title available?)
• A partition calculus in set theory
• Complete ordered sets with no infinite antichains
• Monotone Subnets in Partially Ordered Sets
• Partial well‐ordering of sets of vectors
• Partially Ordered Sets
• Well quasi-ordered sets and ideals in free semigroups and algebras

Cited in

(3)

• Ordered sets with no chains of ideals of a given type
• Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets)
• scientific article; zbMATH DE number 850765 (Why is no real title available?)

This page was built for publication: The Erdős-Dushnik-Miller theorem for topological graphs and orders

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