Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result (Q6094048)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result |
scientific article; zbMATH DE number 7747427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result |
scientific article; zbMATH DE number 7747427 |
Statements
Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result (English)
0 references
9 October 2023
0 references
maximum degree
0 references
minimum degree
0 references
spanning tree
0 references
0 references
0.9844489693641664
0 references
0.9798606038093568
0 references
0.797605574131012
0 references
0.7975903749465942
0 references
0.7962616086006165
0 references
