Qifan Wang

collaborators

3 papers

math.CO2026

An improved range for the maximum critically $t$ -intersecting hypergraphs

Lu Lu, Rongrong Lu, Qifan Wang +1

Let $k > t \geq 1$ be integers and set $d = k - t$ . A $k$ -uniform hypergraph $F$ is called $t$ -intersecting if any two edges intersect in at least $t$ vertices, and is called $t$ -…

math.CO2026

On a conjecture regarding the product version of the Hilton-Milner theorem

Xucheng Bu, Lihua Feng, Zejun Huang +2

Recently, Frankl and Wang considered a product version of the classical Hilton-Milner theorem. They conjectured that, if $F \subset (k [ n ])$ and $\mathcal{G} \subs…

math.CO2026

Improved bound on symmetric differences of intersecting families

Lihua Feng, Zejun Huang, Qifan Wang +1

For a family $F$ , it is called intersecting if $F \cap F^{'} \neq = \emptyset$ for all $F, F^{'} \in F$ . We use $\mathcal{SD}(\mathcal{F}) = \{F \triangle G : F, G \in \math…

An improved range for the maximum critically t-intersecting hypergraphs

On a conjecture regarding the product version of the Hilton-Milner theorem

Improved bound on symmetric differences of intersecting families

An improved range for the maximum critically $t$ -intersecting hypergraphs