The Turán Number for 4 · Sℓ1
The Turán number of a graph H, denoted by ex(n, H), is the maximum number of edges of an n-vertex simple graph having no H as a subgraph. Let Sℓ denote the star on ℓ + 1 vertices, and let k · Sℓ denote k disjoint copies of Sℓ. Erdős and Gallai determined the value ex(n, k · S1) for all positive inte...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2022-11-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2338 |