Erfei Yue

collaborators

4 papers

math.CO2025

Poset saturation of unions of chains

Shengjin Ji, BalÃ¡zs PatkÃ³s, Erfei Yue

A family $G$ of sets is a(n induced) copy of a poset $P = (P, ⩽)$ if there exists a bijection $b : P \to G$ such that $p ⩽ q$ holds if and only…

math.CO2025

Some results on minimum saturated graphs

Chenke Zhang, Qing Cui, Jinze Hu +2

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

math.CO2025

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

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

For a family of sets $F$ , let $I ¨ (F) := \sum_{{A, B} \subset F} ∣ A \cap B ∣$ . In this paper, we prove that provided $n$ is sufficiently large, for any $\ma…

math.CO2024

On BollobÃ¡s-type theorems of $d$ -tuples

Erfei Yue

In 1965, BollobÃ¡s proved that for a BollobÃ¡s set-pair system ${(A_{i}, B_{i}) ∣ i \in [m]}$ , the maximum value of $\sum_{i = 1}^{m} (A _{i} ∣ A _{i} ∣ + ∣ B _{i} ∣)^{- 1}$ is $1$ . HegedÃ¼s and Fr…

Poset saturation of unions of chains

Some results on minimum saturated graphs

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

On BollobÃ¡s-type theorems of d-tuples

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

On BollobÃ¡s-type theorems of $d$ -tuples