Graphs and Combinatorics

, Volume 29, Issue 5, pp 1305–1309 | Cite as

A Note on Turán Numbers for Even Wheels

Open Access
Original Paper


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, we show that \({ex(n,W_6)= \lfloor\frac{n^2}{3}\rfloor}\) for all n ≥ 6. These numbers can be useful to calculate some Ramsey numbers.


Turán problem Cycles 

Mathematics Subject Classification (2000)

05C35 05C38 


  1. 1.
    Bondy A.J., Murty S.U.: Graph Theory with Applications. American Elsevier Publishing Co., New York (1976)MATHGoogle Scholar
  2. 2.
    Caccetta L., Vijayan K.: Maximal cycles in graphs. Discret. Math. 98, 1–7 (1991)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Mantel, W.: Problem 28, soln. by H. Gouventak, W. Mantel, J. Teixeira de Mattes, F. Schuh and W.A. Wythoff. Wiskundige Opgaven 10, 60–61 (1907)Google Scholar
  4. 4.
    Simonovits M.: A method for solving extremal problems in graph theory, stability problems. In: Theory of Graphs. Academic Press, New York (1968)Google Scholar
  5. 5.
    Turán P.: On an extremal problem in graph theory. Mat. Fiz. Lapok 48, 436–452 (1941)MathSciNetGoogle Scholar
  6. 6.
    Woodall R.D.: Sufficient conditions for circuits in graphs. Proc. Lond. Math. Soc. 24, 739–755 (1972)MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Yang Y., Rowlinson P.: On the third Ramsey numbers of graphs with five edges. J. Combin. Math. Combin. Comput. 11, 213–222 (1992)MathSciNetMATHGoogle Scholar
  8. 8.
    Radziszowski, S.P.: Small Ramsey numbers. Electron. J. Combin., Dynamic Survey 1, revision Accessed August 2011

Copyright information

© The Author(s) 2012

Authors and Affiliations

  1. 1.Institute of InformaticsUniversity of GdańskGdańskPoland

Personalised recommendations