The use of elementary substructures in combinatorics (Q1344620)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 722492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The use of elementary substructures in combinatorics |
scientific article; zbMATH DE number 722492 |
Statements
The use of elementary substructures in combinatorics (English)
0 references
24 August 1995
0 references
The technique of arguments utilizing the elementary substructure method is illustrated by a proof of the Erdős-Rado partition theorem, by a result (given by Erdős, Hajnal, Milner) on the nonseparatedness of uncountably chromatic subgraphs of the Specker graph and by a theorem (of Milner and Komjáth) on a tree partition property of the Specker graph.
0 references
infinite graphs
0 references
elementary substructure
0 references
Erdős-Rado partition theorem
0 references
uncountably chromatic subgraphs of the Specker graph
0 references
tree partition property
0 references
0.7999434471130371
0 references
0.7717450261116028
0 references
0.7511383891105652
0 references
0.7325559258460999
0 references
