Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) (Q965963): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Anna S. Lladó / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Susana-Clara López / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Jordi Moragas / rank | |||
Normal rank | |||
Revision as of 14:22, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) |
scientific article |
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
