Jiaxi Nie

activity

20242026

collaborators

13 papers

math.CO2026

Matching and intersection problems for non-trivial $r$ -partite $r$ -uniform hypergraphs

Peter Frankl, Jiaxi Nie

A central theme in extremal combinatorics is the study of the maximum number of edges in an $r$ -uniform hypergraph ( $r$ -graph) with matching number at most $s$ (the ErdÅs Matching…

math.CO2026

Hypergraph Ramsey numbers with quasipolynomial growth rate

Xiaoyu He, Jiaxi Nie, Logan Post +1

For a 3-uniform hypergraph (3-graph) $F$ , let $r (F, n)$ be the smallest $N$ such that any $N$ -vertex $F$ -free 3-graph has an independent set of size $n$ . We construct a $3$ -graph $H…

math.CO2025

Decomposition of Cliques into $k$ -Star-Forests

Jiaxi Nie, Yibo Ren, Hehui Wu

A $k$ -star-forest is a forest with at most $k$ connected components where each component is a star. Let $F_{k} (n)$ be the minimum integer such that the complete graph on $n$ vertices…

math.CO2025

On the Matching Problem in Random Hypergraphs

Peter Frankl, Jiaxi Nie, Jian Wang

We study a variant of the ErdÅs Matching Problem in random hypergraphs. Let $K_{p} (n, k)$ denote the ErdÅs-RÃ©nyi random $k$ -uniform hypergraph on $n$ vertices where each…

math.CO2025

Maximum in-general-position set in a random subset of $F_{q}^{d}$

Yaobin Chen, Jiaxi Nie, Jing Yu +1

Let $I^\pm (F_{q}^{d}, p)$ be the maximum possible size of a point set in general position in a $p$ -random subset of $F_{q}^{d}$ . We determine the order of magnitude of $Î±(…

math.CO2025

Evasive sets, twisted varieties, and container-clique trees

Jeck Lim, Jiaxi Nie, Ji Zeng

In the affine space $F_{q}^{n}$ over the finite field of order $q$ , a point set $S$ is said to be $(d, k, r)$ -evasive if the intersection between $S$ and any variety, of dimensi…

Matching and intersection problems for non-trivial r-partite r-uniform hypergraphs

Hypergraph Ramsey numbers with quasipolynomial growth rate

Decomposition of Cliques into k-Star-Forests

On the Matching Problem in Random Hypergraphs

Maximum in-general-position set in a random subset of Fqd​

Evasive sets, twisted varieties, and container-clique trees

Matching and intersection problems for non-trivial $r$ -partite $r$ -uniform hypergraphs

Decomposition of Cliques into $k$ -Star-Forests

Maximum in-general-position set in a random subset of $F_{q}^{d}$