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

DOI10.1007/BF00383601zbMath0574.05045OpenAlexW2088409042MaRDI QIDQ1063007

Maurice Pouzet, Eric C. Milner

Publication date: 1985

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

comparability graphindependent setcomplete graphtopological spacetopological graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complete ordered sets with no infinite antichains
• Well quasi-ordered sets and ideals in free semigroups and algebras
• A partition calculus in set theory
• Monotone Subnets in Partially Ordered Sets
• Partially Ordered Sets
• Partial well‐ordering of sets of vectors

Related Items (2)

Ordered sets with no chains of ideals of a given type ⋮ Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets)

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