Pentagons vs. triangles

Authors

Béla Bollobás, Trinity College CambridgeFollow
Ervin Gyori, Magyar Tudomanyos Akademia

Abstract

We study the maximum number of triangles in graphs with no cycle of length 5 and analogously, the maximum number of edges in 3-uniform hypergraphs with no cycle of length 5. © 2007 Elsevier B.V. All rights reserved.

Publication Title

Discrete Mathematics

Recommended Citation

Bollobás, B., & Gyori, E. (2008). Pentagons vs. triangles. Discrete Mathematics, 308 (19), 4332-4336. https://doi.org/10.1016/j.disc.2007.08.016