Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) (Q965963)
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 5701939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) |
scientific article; zbMATH DE number 5701939 |
Statements
Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) (English)
0 references
27 April 2010
0 references
graph labelings
0 references
graph decompositions
0 references
combinatorial nullstellensatz
0 references
0.9004818201065063
0 references
0.8750761151313782
0 references
0.872086226940155
0 references
0.8583617210388184
0 references
0.8567900657653809
0 references
