Jian Wang

collaborators

2 papers

math.CO2026

Intersecting families with covering number three II

Peter Frankl, Jian Wang

A family $F \subset (k [ n ])$ is called intersecting if $F \cap F^{'} \neq = \emptyset$ for all $F, F^{'} \in F$ . The covering number of a family $F$ is defi…

math.CO2024

Intersecting families with covering number three

Peter Frankl, Jian Wang

We consider $k$ -graphs on $n$ vertices, that is, $F \subset (k [ n ])$ . A $k$ -graph $F$ is called intersecting if $F \cap F^{'} \neq = \emptyset$ for all $F,F'\in…