On the number ofC 5′S in a triangle-free graph

Combinatorica volume 9, pages101–102(1989)Cite this article

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

US$ 39.95

Tax calculation will be finalised during checkout.

Reference

  1. [1]

    P.Erdős, On some problems in graph theory, combinatorial analysis and combinatorial number theory,Graph Theory and Combinatosics (ed: B. Bollobás), 1–17.

Download references

Author information

Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences, P.O.B. 127, H-1364, Budapest

    E. Győri

Authors
  1. E. Győri
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research partially supported bv Hungarian National Foundation for Scientific Research Grant no. 1812.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Győri, E. On the number ofC 5′S in a triangle-free graph. Combinatorica 9, 101–102 (1989). https://doi.org/10.1007/BF02122689

Download citation

AMS subject classification (1980)

  • 05C35
  • 05C38