Hostname: page-component-6766d58669-kl59c Total loading time: 0 Render date: 2026-05-22T15:05:34.639Z Has data issue: false hasContentIssue false
  • English
  • Français

Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2

Part of: Extremal combinatorics Graph theory

Published online by Cambridge University Press:  27 November 2019

Beka Ergemlidze ,
Ervin Győri ,
Abhishek Methuku ,
Nika Salia ,
Casey Tompkins  and
Oscar Zamora
Beka Ergemlidze
Affiliation:
Department of Mathematics and its Applications, Central European University, 1051 Budapest, Hungary
Ervin Győri*
Affiliation:
Department of Mathematics and its Applications, Central European University, 1051 Budapest, Hungary Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, 1053 Budapest, Hungary
Abhishek Methuku
Affiliation:
Department of Mathematics and its Applications, Central European University, 1051 Budapest, Hungary École Polytechnique Fédérale de Lausanne, 1015 Lausanne, Switzerland
Nika Salia
Affiliation:
Department of Mathematics and its Applications, Central European University, 1051 Budapest, Hungary
Casey Tompkins
Affiliation:
Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, 1053 Budapest, Hungary
Oscar Zamora
Affiliation:
Department of Mathematics and its Applications, Central European University, 1051 Budapest, Hungary Escuela de Matemática, Universidad de Costa Rica, San José, Costa Rica
*
*Corresponding author. Email: gyori.ervin@renyi.mta.hu
Get access Rights & Permissions [Opens in a new window]

Abstract

The maximum size of an r-uniform hypergraph without a Berge cycle of length at least k has been determined for all k ≥ r + 3 by Füredi, Kostochka and Luo and for k < r (and k = r, asymptotically) by Kostochka and Luo. In this paper we settle the remaining cases: k = r + 1 and k = r + 2, proving a conjecture of Füredi, Kostochka and Luo.

MSC classification

Primary: 05C65: Hypergraphs
Secondary: 05D99: None of the above, but in this section

Information

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 29 , Issue 3 , May 2020 , pp. 423 - 435
Copyright
© Cambridge University Press 2019

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Davoodi, A., Győri, E., Methuku, A. and Tompkins, C. (2018) An Erdős–Gallai type theorem for uniform hypergraphs. Eur. J. Combin. 69 159–162.CrossRefGoogle Scholar
Erdős, P. and Gallai, T. (1959) On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hungar. 10 337–356.CrossRefGoogle Scholar
Füredi, Z., Kostochka, A. and Luo, R. (2019) Avoiding long Berge cycles. J. Combin. Theory Ser. B 137 55–64.CrossRefGoogle Scholar
Füredi, Z., Kostochka, A. and Luo, R. (2018) Avoiding long Berge cycles, II: Exact bounds for all n. arXiv:1807.06119Google Scholar
Gerbner, D., Methuku, A. and Vizer, M. (2019) Asymptotics for the Turán number of Berge-K 2,t. J. Combin. Theory Ser. B 137 264–290.CrossRefGoogle Scholar
Gerbner, D., Methuku, A. and Palmer, C. (2018) General lemmas for Berge–Turán hypergraph problems. arXiv:1808.10842Google Scholar
Gerbner, D. and Palmer, C. (2017) Extremal results for Berge-hypergraphs. SIAM J. Discrete Math. 31 2314–2327.CrossRefGoogle Scholar
Grósz, D., Methuku, A. and Tompkins, C. (2017) Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs. Electron. Notes Discrete Math. 61 527–533.CrossRefGoogle Scholar
Győri, E., Katona, G. Y. and Lemons, N. (2016) Hypergraph extensions of the Erdos–Gallai theorem. Eur. J. Combin. 58 238–246.CrossRefGoogle Scholar
Győri, E., Methuku, A., Salia, N., Tompkins, C. and Vizer, M. (2018) On the maximum size of connected hypergraphs without a path of given length. Discrete Math. 341 2602–2605.CrossRefGoogle Scholar
Kostochka, A. and Luo, R. (2018) On r-uniform hypergraphs with circumference less than r. arXiv:1807.04683Google Scholar