collaborators

7 papers

math.CO2025

Some results on minimum saturated graphs

Chenke Zhang, Qing Cui, Jinze Hu +2

Let be a graph and be a family of graphs. We say a graph is -saturated if does not contain any member in and for any $e\in E(\o…

math.CO2025

Poset saturation of unions of chains

Shengjin Ji, Balázs Patkós, Erfei Yue

A family of sets is a(n induced) copy of a poset if there exists a bijection such that holds if and only…

math.CO2024

On Bollobás-type theorems of -tuples

Erfei Yue

In 1965, Bollobás proved that for a Bollobás set-pair system , the maximum value of is . Hegedüs and Frank…

math.CO2024

A Bollobáss-type theorem on singular linear spaces

Erfei Yue, Benjian Lv, Péter Sziklai +1

Bollobás-type theorem determines the maximum cardinality of a Bollobás system of sets. The original result has been extended to various mathematical structures beyond sets, includi…

math.CO2024

The maximum sum of the sizes of all intersections within -size families

Sumin Huang, Gyula O. H. Katona, Erfei Yue

For a family of sets , let . In this paper, we prove that provided is sufficiently large, for any $\mat…

math.CO2024

Some new Bollobás-type inequalities

Erfei Yue

A family of disjoint pairs of finite sets is called a Bollobás system if for every , and a skew Bollobás…

math.CO2024

On the structures of subset sums in higher dimension

Norbert Hegyvári, Máté Pálfy, Erfei Yue

A given subset of natural numbers is said to be complete if every element of is the sum of distinct terms taken from . This topic is strongly connected to the knapsack…