Yongjiang Wu

activity

20242026

most citedA result for hemi-bundled cross-intersecting families

1 citations · 1 across the 15 of their papers we have counts for

collaborators

Showing 2024Show all

5 papers · 1 filter

math.CO2024

Proof of Frankl's conjecture on cross-intersecting families

Yongjiang Wu, Lihua Feng, Yongtao Li

Two families $F$ and $G$ are called cross-intersecting if for every $F \in F$ and $G \in G$ , the intersection $F \cap G$ is non-empty. For any…

math.CO2024★ 1 cited

A result for hemi-bundled cross-intersecting families

Yongjiang Wu, Lihua Feng, Yongtao Li

Two families $F$ and $G$ are called cross-intersecting if for every $F \in F$ and $G \in G$ , the intersection $F \cap G$ is non-empty. It is si…

math.CO2024

Stabilities of the Kleitman diameter theorem

Yongjiang Wu, Yongtao Li, Lihua Feng +2

Let $F$ be a family of subsets of $[n]$ . The diameter of $F$ is the maximum size of symmetric differences among pairs of its members. Resolving a conjecture of…

math.CO2024

Maximal intersecting families revisited

Yongjiang Wu, Yongtao Li, Lihua Feng +2

The well-known Erdős--Ko--Rado theorem states that for $n > 2 k$ , every intersecting family of $k$ -sets of $[n] := {1, \dots, n}$ has at most $(k - 1 n - 1)$ sets, and the extre…

math.CO2024

Snevily's Conjecture about $L$ -intersecting Families on Set Systems and its Analogue on Vector Spaces

Jiuqiang Liu, Guihai Yu, Lihua Feng +1

The classical Erdős-Ko-Rado theorem on the size of an intersecting family of $k$ -subsets of the set $[n] = {1, 2, \dots, n}$ is one of the fundamental intersection theorems for s…

Proof of Frankl's conjecture on cross-intersecting families

A result for hemi-bundled cross-intersecting families

Stabilities of the Kleitman diameter theorem

Maximal intersecting families revisited

Snevily's Conjecture about L-intersecting Families on Set Systems and its Analogue on Vector Spaces

Snevily's Conjecture about $L$ -intersecting Families on Set Systems and its Analogue on Vector Spaces