# A Note on Turán Numbers for Even Wheels

@article{Dzido2013ANO, title={A Note on Tur{\'a}n Numbers for Even Wheels}, author={Tomasz Dzido}, journal={Graphs and Combinatorics}, year={2013}, volume={29}, pages={1305-1309} }

- Published 2013 in Graphs and Combinatorics
DOI:10.1007/s00373-012-1212-9

The Turán number ex(n, G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. We consider a very special case of the Simonovits’s theorem (Simonovits in: Theory of graphs, Academic Press, New York, 1968) which determine an asymptotic result for Turán numbers for graphs with some properties. In the paper we present a more precise result for even wheels. We provide the exact value for Turán number ex(n, W2k) for n ≥ 6k − 10 and k ≥ 3. In addition… CONTINUE READING

#### From This Paper

##### Topics from this paper.

#### Citations

##### Publications citing this paper.

## Extremal H-free planar graphs

View 4 Excerpts

Highly Influenced

#### References

##### Publications referenced by this paper.

Showing 1-9 of 9 references

## A method for solving extremal problems in graph theory, stability problems

View 3 Excerpts

Highly Influenced

## Dynamic Survey 1, revision #13

## On the third Ramsey numbers of graphs with five edges

View 1 Excerpt

## Maximal cycles in graphs

View 1 Excerpt

## Sufficient conditions for circuits in graphs

View 1 Excerpt

## On an extremal problem in graph theory

View 1 Excerpt

## Problem 28, soln

View 1 Excerpt