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

DOI10.1007/BF00383601zbMATH Open0574.05045OpenAlexW2088409042MaRDI QIDQ1063007FDOQ1063007

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

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

zbMATH Keywords

topological spaceindependent settopological graphcomplete graphcomparability graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Partially Ordered Sets
• Partial well‐ordering of sets of vectors
• A partition calculus in set theory
• Title not available (Why is that?)
• Complete ordered sets with no infinite antichains
• Well quasi-ordered sets and ideals in free semigroups and algebras
• Monotone Subnets in Partially Ordered Sets

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)
• Title not available (Why is that?)

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)