Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) (Q965963): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2009.09.021 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091970724 / rank | |||
Normal rank | |||
Revision as of 20:44, 19 March 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
