The Erdős-Dushnik-Miller theorem for topological graphs and orders (Q1063007): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5581652 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complete ordered sets with no infinite antichains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partially Ordered Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A partition calculus in set theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monotone Subnets in Partially Ordered Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3226265 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3852172 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5340517 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partial well‐ordering of sets of vectors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Well quasi-ordered sets and ideals in free semigroups and algebras / rank | |||
Normal rank |
Revision as of 18:51, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Erdős-Dushnik-Miller theorem for topological graphs and orders |
scientific article |
Statements
The Erdős-Dushnik-Miller theorem for topological graphs and orders (English)
0 references
1985
0 references
A topological graph is a graph \(G=(V,E)\) on a topological space V such that the edge set E is a closed subset of the product space \(V\times V\). If the graph contains no infinite independent set then, by a well-known theorem of Erdős, Dushnik and Miller, for any infinite set \(L\subseteq V\), there is a subset L'\(\subseteq L\) of the same cardinality \(| L'| =| L|\) such that the restriction \(G\upharpoonright L'\) is a complete graph. We investigate the question of whether the same conclusion holds if we weaken the hypothesis and assume only that some dense subset \(A\subseteq V\) does not contain an infinite independent set. If the cofinality \(cf(| L|)>| A|\), then there is an L' as before, but if cf(\(| L|)\leq | A|\), then some additional hypothesis seems to be required. We prove that, if the graph \(G\upharpoonright A\) is a comparability graph and A is a dense subset, then for any set \(L\subseteq V\) such that \(cf(| L|)>\omega\), there is a subset L'\(\subseteq L\) of size \(| L'| =| L|\) such that \(G\upharpoonright L'\) is complete. The condition \(cf(| L| >\omega\) is needed.
0 references
topological graph
0 references
topological space
0 references
complete graph
0 references
independent set
0 references
comparability graph
0 references