Jian Wang

collaborators

5 papers

math.CO2025

On the largest degrees in intersecting hypergraphs

Peter Frankl, Jian Wang

Let $(k [ n ])$ denote the collection of all $k$ -subsets of the standard $n$ -set $[n] = {1, 2, \dots, n}$ . Let $n > 2 k$ and let $F \subset (k [ n ])$ be an {\it inte…

math.CO2025

The overflow in the Katona Theorem

Peter Frankl, Jian Wang

Let $n > 2 r > 0$ be integers. We consider families $F$ of subsets of an $n$ -element set, in which the union of any two members has size at most $2 r$ . One of our results state…

math.CO2025

On resilient hypergraphs

Peter Frankl, Jian Wang

The matching number of a $k$ -graph is the maximum number of pairwise disjoint edges in it. The $k$ -graph is called $t$ -resilient if omitting $t$ vertices never decreases its matchi…

math.CO2024

The maximum sturdiness of intersecting families

Peter Frankl, Jian Wang

Given a family $F \subset 2^{[n]}$ and $1 \leq i \neq = j \leq n$ , we use $F (i ˉ, j)$ to denote the family $\{F\setminus \{j\}\colon F\in \mathcal{F},\ F\cap \{i,j…

math.CO2024

On $r$ -wise $t$ -intersecting uniform families

Peter Frankl, Jian Wang

We consider families, $F$ of $k$ -subsets of an $n$ -set. For integers $r \geq 2$ , $t \geq 1$ , $F$ is called $r$ -wise $t$ -intersecting if any $r$ of its members hav…

On the largest degrees in intersecting hypergraphs

The overflow in the Katona Theorem

On resilient hypergraphs

The maximum sturdiness of intersecting families

On r-wise t-intersecting uniform families

On $r$ -wise $t$ -intersecting uniform families