| Tartalom: |
http://real.mtak.hu/98609/ |
| Archívum: |
REAL |
| Gyűjtemény: |
Status = Published
Type = Article
Subject = Q Science / természettudomány: QA Mathematics / matematika: QA166-QA166.245 Graphs theory / gráfelmélet
|
| Cím: |
A note on the maximum number of triangles in a C5-free graph
|
| Létrehozó: |
Ergemlidze, Beka
Methuku, Abhishek
Salia, Nika
Győri, Ervin
|
| Kiadó: |
Wiley
|
| Dátum: |
2019
|
| Téma: |
QA166-QA166.245 Graphs theory / gráfelmélet
|
| Tartalmi leírás: |
We prove that the maximum number of triangles in a C5-free graph on n vertices is at most 1/2√2(1+o(1))n3/2, improving an estimate of Alon and Shikhelman.
|
| Nyelv: |
angol
|
| Típus: |
Article
PeerReviewed
info:eu-repo/semantics/article
|
| Formátum: |
text
|
| Azonosító: |
Ergemlidze, Beka and Methuku, Abhishek and Salia, Nika and Győri, Ervin (2019) A note on the maximum number of triangles in a C5-free graph. JOURNAL OF GRAPH THEORY, 90 (3). pp. 227-230. ISSN 0364-9024
|
| Kapcsolat: |
MTMT:30384299 10.1002/jgt.22390
|
| Létrehozó: |
cc_by
|
