On extremal hypergraphs for forests of tight paths

Ran Gu and Rui Li

Applied Mathematics and Computation, 2018, vol. 325, issue C, 291-296

Abstract: In this paper, we investigate the maximal size of a k-uniform hypergraph containing no forests of tight paths, which extends the classical Erdős–Gallai Theorem for paths in graphs. Our results build on the results of Györi, Katona and Lemons, who considered the maximal size of a k-uniform hypergraph containing no single tight path.

Keywords: Extremal; Hypergraphs; Paths; Hyperpaths (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317309037
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:325:y:2018:i:c:p:291-296

DOI: 10.1016/j.amc.2017.12.036

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().