Loading...
Please wait, while we are loading the content...
Similar Documents
Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2
| Content Provider | Scilit |
|---|---|
| Author | Ergemlidze, Beka Győri, Ervin Methuku, Abhishek Salia, Nika Tompkins, Casey Zamora, Oscar |
| Copyright Year | 2019 |
| Description | 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. |
| Related Links | http://arxiv.org/pdf/1808.07687 https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2746031EF10465255DDC3A1E36CCFD76/S0963548319000415a.pdf/div-class-title-avoiding-long-berge-cycles-the-missing-cases-span-class-italic-k-span-span-class-italic-r-span-1-and-span-class-italic-k-span-span-class-italic-r-span-2-div.pdf |
| Ending Page | 435 |
| Page Count | 13 |
| Starting Page | 423 |
| ISSN | 09635483 |
| e-ISSN | 14692163 |
| DOI | 10.1017/s0963548319000415 |
| Journal | Combinatorics, Probability and Computing |
| Issue Number | 3 |
| Volume Number | 29 |
| Language | English |
| Publisher | Cambridge University Press (CUP) |
| Publisher Date | 2020-05-01 |
| Access Restriction | Open |
| Subject Keyword | Combinatorics, Probability and Computing Applied Mathematics |
| Content Type | Text |
| Resource Type | Article |
| Subject | Applied Mathematics Statistics and Probability Theoretical Computer Science Computational Theory and Mathematics |
