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

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

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

Authors

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