Linear three-uniform hypergraphs with no Berge path of given length

arXiv2211.16184MaRDI QIDQ6418902FDOQ6418902

Authors: Ervin Győri, Nika Salia 

Publication date: 29 November 2022

Abstract: Extensions of ErdH{o}s-Gallai Theorem for general hypergraphs are well studied. In this work, we prove the extension of ErdH{o}s-Gallai Theorem for linear hypergraphs. In particular, we show that the number of hyperedges in an $n$-vertex $3$-uniform linear hypergraph, without a Berge path of length $k$ as a subgraph is at most $frac(k-1)6n$ for $kgeq4$.

This page was built for publication: Linear three-uniform hypergraphs with no Berge path of given length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6418902)