A stability result for Berge-K3, t r-graphs and its applications
J Zhou, X Yuan, WH Wang - Discrete Applied Mathematics, 2024 - Elsevier
An r-uniform hypergraph (r-graph) is linear if any two edges intersect at most one vertex. For
a graph F, a hypergraph H is a Berge-F if there is a bijection ϕ: E (F)→ E (H) such that e⊆ ϕ …
a graph F, a hypergraph H is a Berge-F if there is a bijection ϕ: E (F)→ E (H) such that e⊆ ϕ …
A note on stability results for Berge-Ks, t hypergraphs
J Zhou, X Yuan, F Chen - Discrete Applied Mathematics, 2025 - Elsevier
An r-uniform hypergraph (r-graph) is linear if any two edges intersect at most one vertex. Let
F be a graph. A hypergraph H is a Berge-F if there is a bijection ϕ: E (F)→ E (H) such that …
F be a graph. A hypergraph H is a Berge-F if there is a bijection ϕ: E (F)→ E (H) such that …
Finding Set Extreme 3-Uniform Hypergraphs Cardinality through Second-Order Signatures
E Egorova, V Leonov, A Mokryakov, V Tsurkov - Axioms, 2024 - mdpi.com
This paper continues the study of second-order signature properties—the characterization of
the extreme 3-uniform hypergraph. Previously, bases were used to count extreme 3-uniform …
the extreme 3-uniform hypergraph. Previously, bases were used to count extreme 3-uniform …
Tur\'{a} n problems for star-path forests in hypergraphs
J Zhou, X Yuan - arXiv preprint arXiv:2403.06637, 2024 - arxiv.org
An $ r $-uniform hypergraph ($ r $-graph) is linear if any two edges intersect at most one
vertex. Let $\mathcal {F} $ be a given family of $ r $-graphs. A hypergraph $ H $ is called …
vertex. Let $\mathcal {F} $ be a given family of $ r $-graphs. A hypergraph $ H $ is called …
The Turán number of Berge book hypergraphs
D Gerbner - SIAM Journal on Discrete Mathematics, 2024 - SIAM
Given a graph, a Berge copy of is a hypergraph obtained by enlarging the edges arbitrarily.
Győri [Combin. Probab. Comput., 15 (2006), pp. 185–191] showed that for or, an-uniform …
Győri [Combin. Probab. Comput., 15 (2006), pp. 185–191] showed that for or, an-uniform …