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

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

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

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

Instant access to the full article PDF.

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.

Mathematical Institute of the Hungarian Academy of Sciences, P.O.B. 127, H-1364, Budapest
E. Győri

Authors

E. Győri
View author publications
You can also search for this author in PubMed Google Scholar

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

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

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

Instant access to the full article PDF.