Ramsey-type theorem for spatial graphs (Q1385300)
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 1146348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ramsey-type theorem for spatial graphs |
scientific article; zbMATH DE number 1146348 |
Statements
Ramsey-type theorem for spatial graphs (English)
0 references
26 April 1998
0 references
The author shows that for every imbedding of a graph \(H\) in \(\mathbb{R}^3\), there exist positive integers \(m\) and \(n\) such that every imbedding of the complete bipartite graph \(K_{m,n}\) in \(\mathbb{R}^3\) whose projection in the \(xy\)-plane consists entirely of straight edges contains a subgraph which is ambient isotopic to \(H\).
0 references
Ramsey-type theorem
0 references
spatial graphs
0 references
imbedding
0 references
0.8452157974243164
0 references
0.8334358930587769
0 references
0.8227475881576538
0 references
