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
|
Text
1412.8083v2.pdf Download (190kB) | Preview |
Official URL: https://doi.org/10.1016/j.dam.2016.10.013
Abstract
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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Graph theory; Upper Bound; Triple system; nocv1; Linear hypergraphs; Hyper graph; Extremal graph; 3-uniform hypergraphs; Mathematical techniques; Combinatorial mathematics; Turán number; Triple systems; TRIANGLES; Extremal graphs; cycles |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 05 Dec 2017 10:15 |
| Last Modified: | 05 Dec 2017 10:15 |
| URI: | http://real.mtak.hu/id/eprint/70730 |
Actions (login required)
 |
Edit Item |
