| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650422 | Discrete Mathematics | 2008 | 5 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Béla Bollobás, Ervin Győri,