Constructing trees in graphs with no <i>K</i><sub>2,<i>s</i></sub> (Q5434262)
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 5223153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing trees in graphs with no <i>K</i><sub>2,<i>s</i></sub> |
scientific article; zbMATH DE number 5223153 |
Statements
Constructing trees in graphs with no <i>K</i><sub>2,<i>s</i></sub> (English)
0 references
4 January 2008
0 references
trees
0 references
Erdős-Sós conjecture
0 references
0.8857612013816833
0 references
0.8636199831962585
0 references
0.8548626899719238
0 references
