4 citations · 8 across the 23 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021
On Asymptotic Packing of Geometric Graphs
Daniel W. Cranston, Jiaxi Nie, Jacques Verstraëte +1
A set of geometric graphs is {\em geometric-packable} if it can be asymptotically packed into every sequence of drawings of the complete graph . For example, the set of geomet…
math.CO2021
Maximal independent sets in clique-free graphs
Xiaoyu He, Jiaxi Nie, Sam Spiro
Nielsen proved that the maximum number of maximal independent sets (MIS's) of size in an -vertex graph is asymptotic to , with the extremal construction a disjoint…
math.CO2021★ 2 cited
Ramsey Numbers for Non-trivial Berge Cycles
Jiaxi Nie, Jacques Verstraëte
In this paper, we consider an extension of cycle-complete graph Ramsey numbers to Berge cycles in hypergraphs: for , a {\em non-trivial Berge -cycle} is a family of se…