Jian Wang

activity

20242026

collaborators

Showing 2025Show all

3 papers · 1 filter

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…