Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.08.016 | Discrete Mathematics |
Keywords | Field | DocType |
cycles,extremal graphs,extremal hypergraphs | Discrete mathematics,Graph,Combinatorics,Hypergraph,Constraint graph,Cycle graph,Mathematics | Journal |
Volume | Issue | ISSN |
308 | 19 | Discrete Mathematics |
Citations | PageRank | References |
8 | 1.14 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Béla Bollobás | 1 | 2696 | 474.16 |
| Ervin Győri | 2 | 65 | 7.92 |