Jiaxi Nie

activity

20202026

most citedTriangle-free Subgraphs of Hypergraphs

4 citations · 8 across the 23 of their papers we have counts for

collaborators

Showing 2023Show all

5 papers · 1 filter

math.CO2023

Sidorenko Hypergraphs and Random Turán Numbers

Jiaxi Nie, Sam Spiro

Let $ex (G_{n, p}^{r}, F)$ denote the maximum number of edges in an $F$ -free subgraph of the random $r$ -uniform hypergraph $G_{n, p}^{r}$ , and let $s(F):=\sup\{s: \exists H,\ t_F(…

math.CO2023

Random Turán and counting results for general position sets over finite fields

Yaobin Chen, Xizhi Liu, Jiaxi Nie +1

Let $α (F_{q}^{d}, p)$ denote the maximum size of a general position set in a $p$ -random subset of $F_{q}^{d}$ . We determine the order of magnitude of $α (F_{q}^{2}, p)$ …

math.CO2023

Random Turán theorem for expansions of spanning subgraphs of tight trees

Jiaxi Nie

The $r$ -expansion of a $k$ -uniform hypergraph $H$ , denoted by $H^{(+ r)}$ , is an $r$ -uniform hypergraph obtained by enlarging each $k$ -edge of $H$ with a set of $r - k$ vertices of de…

math.CO2023

Turán theorems for even cycles in random hypergraph

Jiaxi Nie

Let $F$ be a family of $r$ -uniform hypergraphs. The random Turán number $ex (G_{n, p}^{r}, F)$ is the maximum number of edges in an $F$ -free subgr…

math.CO2023

On asymptotic local Turán problems

Peter Frankl, Jiaxi Nie

An $r$ -uniform hypergraph has $(q, p)$ -property if any set of $q$ vertices spans a complete sub-hypergraph on $p$ vertices. Let $t_{r} (n, q, p)$ be the minimum edge density of an $n$ -ve…