Pentagons vs. triangles (Q941370)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Pentagons vs. triangles |
scientific article; zbMATH DE number 5321306
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pentagons vs. triangles |
scientific article; zbMATH DE number 5321306 |
Statements
Pentagons vs. triangles (English)
0 references
4 September 2008
0 references
In this paper two main results about graphs and hypergraphs with no cycle of length 5 are presented. The first one consists in a lower bound to the number of triangles in a graph that does not contain any cycle of length 5. The second result is an upper bound to \(| H|\), where \((V, H)\) is a 3-uniform hypergraph that does not contain any 5-cycle.
0 references
extremal graphs
0 references
hypergraphs
0 references
cycles
0 references
