Skip to main content
SpringerLink
Log in

Covering odd cycles

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

We estimate the number of vertices/edges necessary to cover all odd cycles in graphs of given order and odd girth.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B. Bollobás, P. Erdős, M. Simonovits, andE. Szemerédi: Extramal graphs without large forbidden subgraphs, Advances in Graph Theory, B. Bollobás ed.,Annals of Discrete Mathematics,3 (1978), 29–41, also appeared as a problem inB. Bollobás:Extremal Graph Theory, Academic Press 1978, p. 367 Problem 47.

  2. R. Häggkvist: Odd cycles of specified length in non-bipartite graphs,Graph Theory, B. Bollobás ed.,Annals of Discrete Mathematics,13 (1982), 89–100.

    Google Scholar 

  3. A. Lubotzky, R. Phillips, P. Sarnak: Ramanujan graphs,Combinatorica,8 (1988), 261–277.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Rutgers University, 08903, New Brunswick, NJ, U.S.A.

    János Komlós

Authors
  1. János Komlós
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

To the memory of Pál Erdős

Rights and permissions

Reprints and permissions

About this article

Cite this article

Komlós, J. Covering odd cycles. Combinatorica 17, 393–400 (1997). https://doi.org/10.1007/BF01215920

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01215920

Mathematics Subject Classification (1991)

Search

Navigation