4 citations · 8 across the 23 of their papers we have counts for
6 papers · 1 filter
On tight tree-complete hypergraph Ramsey numbers
Jiaxi Nie
Chvátal showed that for any tree with edges the Ramsey number ("Tree-complete graph Ramsey numbers." Journal of Graph Theory 1.1 (1977): 93-93). For …
Random Turán Problems for Expansions
Jiaxi Nie, Sam Spiro
Let denote the -uniform hypergraph obtained from the graph by inserting new vertices inside each edge of . We prove essentially tight bo…
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 denote the Erdős-Rényi random -uniform hypergraph on vertices where each pos…
Off-diagonal Ramsey numbers for slowly growing hypergraphs
Sam Mattheus, Dhruv Mubayi, Jiaxi Nie +1
For a -uniform hypergraph and a positive integer , the Ramsey number denotes the minimum such that every -vertex -free -uniform hypergraph contains…
On odd covers of cliques and disjoint unions
Calum Buchanan, Alexander Clifton, Eric Culver +5
Babai and Frankl posed the ``odd cover problem" of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order…
Random Turán Problems for Hypergraph Expansions
Jiaxi Nie, Sam Spiro
Given an -uniform hypergraph , we define its -uniform expansion to be the hypergraph obtained from by inserting distinct vertices into each edge of…