2017/10/23 by Ervin Győri, Győri, Ervin, Abhishek Methuku +7 · 1 citation
Mathematics · Physics and Astronomy · #Combinatorics (math.CO) #Complex Network Analysis Techniques #FOS: Mathematics #Graph theory and applications #Stochastic processes and statistical mechanics
paper · pdf · doi:10.48550/arxiv.1710.08364
openalex publication_date 2017/10/23 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
In this note we asymptotically determine the maximum number of hyperedges\npossible in an r-uniform, connected n-vertex hypergraph without a Berge\npath of length k, as n and k tend to infinity. We show that, unlike in\nthe graph case, the multiplicative constant is smaller with the assumption of\nconnectivity.\n