P. Frankl

collaborators

3 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

On the $C$ -diversity of intersecting hypergraphs

Peter Frankl, Jian Wang

Let $F \subset (k X)$ be a family consisting of $k$ -subsets of the $n$ -set $X$ . Suppose that $F$ is intersecting, i.e., $F \cap F^{'} \neq = \emptyset$ for all $…

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…

Intersecting families with covering number three II

On the C-diversity of intersecting hypergraphs

Intersecting families with covering number three

On the $C$ -diversity of intersecting hypergraphs