On the Turán number of forests (Q396789)
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: On the Turán number of forests |
scientific article; zbMATH DE number 6330270
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Turán number of forests |
scientific article; zbMATH DE number 6330270 |
Statements
On the Turán number of forests (English)
0 references
14 August 2014
0 references
Summary: The Turán number of a graph \(H, \mathrm{ex}(n,H)\), is the maximum number of edges in a graph on \(n\) vertices which does not have \(H\) as a subgraph. We determine the Turán number and find the unique extremal graph for forests consisting of paths when \(n\) is sufficiently large. This generalizes a result of \textit{N. Bushaw} and \textit{N. Kettle} [Comb. Probab. Comput. 20, No. 6, 837--853 (2011; Zbl 1234.05128)]. We also determine the Turán number and extremal graphs for forests consisting of stars of arbitrary order.
0 references
forest
0 references
edges
0 references
0.9109626412391664
0 references
0.8886770009994507
0 references
0.8722902536392212
0 references
0.8702265620231628
0 references
0.866416335105896
0 references
