Abstract
For a graph F, an r-uniform hypergraph H is a Berge-F if there is a bijection ϕ:E(F)rightarrow E(H) such that esubseteq ϕ(e) for each ein E(F). Given a family F of r-uniform hypergraphs, an r-uniform hypergraph is F-free if it does not contain any member in F as a subhypergraph. The Turán number of F is the maximum number of hyperedges in an F-free r-uniform hypergraph on n vertices. In this paper, some exact and general results on the Turán numbers for several types of Berge forests are obtained.
Get this paper in your agent:
hf papers read 2506.16140 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 0
No model linking this paper
Cite arxiv.org/abs/2506.16140 in a model README.md to link it from this page.
Datasets citing this paper 0
No dataset linking this paper
Cite arxiv.org/abs/2506.16140 in a dataset README.md to link it from this page.
Spaces citing this paper 0
No Space linking this paper
Cite arxiv.org/abs/2506.16140 in a Space README.md to link it from this page.
Collections including this paper 0
No Collection including this paper
Add this paper to a collection to link it from this page.