A Note on Turán Numbers for Even Wheels

  title={A Note on Tur{\'a}n Numbers for Even Wheels},
  author={Tomasz Dzido},
  journal={Graphs and Combinatorics},
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.


Publications citing this paper.

Extremal H-free planar graphs

View 4 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-9 of 9 references

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

M. Simonovits
Theory of Graphs. Academic Press, New York • 1968
View 3 Excerpts
Highly Influenced

Dynamic Survey 1, revision #13

S. P. Radziszowski
Small Ramsey numbers • 2011

On the third Ramsey numbers of graphs with five edges

Y. Yang, P. Rowlinson
J. Combin. Math. Combin. Comput. 11, 213–222 • 1992
View 1 Excerpt

Maximal cycles in graphs

Discrete Mathematics • 1991
View 1 Excerpt

Sufficient conditions for circuits in graphs

R. D. Woodall
Proc. Lond. Math. Soc. 24, 739–755 • 1972
View 1 Excerpt

On an extremal problem in graph theory

P. Turán
Mat. Fiz. Lapok 48, 436–452 • 1941
View 1 Excerpt

Problem 28, soln

W. Mantel
by H. Gouventak, W. Mantel, J. Teixeira de Mattes, F. Schuh and W.A. Wythoff. Wiskundige Opgaven 10, 60–61 • 1907
View 1 Excerpt

Small Ramsey numbers

S. P. Radziszowski

Similar Papers

Loading similar papers…