| Tartalom: |
http://real.mtak.hu/70730/ |
| Archívum: |
MTA Könyvtár |
| Gyűjtemény: |
Status = Published
Type = Article
|
| Cím: |
On 3-uniform hypergraphs without a cycle of a given length
|
| Létrehozó: |
FĂźredi, ZoltĂĄn
Ăzkahya, Lale
|
| Kiadó: |
Elsevier
|
| Dátum: |
2017
|
| Téma: |
QA Mathematics / matematika
|
| Tartalmi leírás: |
We study the maximum number of hyperedges in a 3-uniform hypergraph on n vertices that does not contain a Berge cycle of a given length â. In particular we prove that the upper bound for C2k+1-free hypergraphs is of the order O(k2n1+1/k), improving the upper bound of GyĹri and Lemons (2012) by a factor of Î(k2). Similar bounds are shown for linear hypergraphs. Š 2016 Elsevier B.V.
|
| Nyelv: |
angol
|
| Típus: |
Article
PeerReviewed
info:eu-repo/semantics/article
|
| Formátum: |
text
|
| Azonosító: |
FĂźredi, ZoltĂĄn and Ăzkahya, Lale (2017) On 3-uniform hypergraphs without a cycle of a given length. DISCRETE APPLIED MATHEMATICS, 216. pp. 582-588. ISSN 0166-218X
|
| Kapcsolat: |
https://doi.org/10.1016/j.dam.2016.10.013
MTMT:3298849; doi:10.1016/j.dam.2016.10.013
|
