Pentagons vs. triangles (Q941370): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2007.08.016 / rank | |||
| Property / author | |||
| Property / author: Ervin Gyoeri / rank | |||
| Property / author | |||
| Property / author: Ervin Gyoeri / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.08.016 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1990386955 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3337470 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How to make a graph bipartite / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On maximal paths and circuits of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the number of \(C_ 5's\) in a triangle-free graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On hypergraphs of girth five / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2007.08.016 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:57, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pentagons vs. triangles |
scientific article |
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
