Jiaxi Nie

Orcid: 0000-0002-2657-1675

According to our database1, Jiaxi Nie authored at least 15 papers between 2021 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Random Turán Theorem for Expansions of Spanning Subgraphs of Tight Trees.
SIAM J. Discret. Math., 2026

Maximum in-general-position set in a random subset of Fqd.
J. Comb. Theory B, 2026

Generalized Erdős-Rogers problems for hypergraphs.
Eur. J. Comb., 2026

On the matching problem in random hypergraphs.
Discret. Math., 2026

Sidorenko hypergraphs and random Turán numbers.
Comb. Theory, 2026

Evasive sets, twisted varieties, and container-clique trees.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
The Number of Edge Colorings with Small Independence Number and No Monochromatic $H$.
Electron. J. Comb., 2025

2024
Turán theorems for even cycles in random hypergraph.
J. Comb. Theory B, 2024

2023
On asymptotic packing of convex geometric and ordered graphs.
J. Graph Theory, December, 2023

Odd covers of graphs.
J. Graph Theory, October, 2023

2022
Ramsey Numbers for Nontrivial Berge Cycles.
SIAM J. Discret. Math., 2022

Maximal independent sets in clique-free graphs.
Eur. J. Comb., 2022

On asymptotic packing of geometric graphs.
Discret. Appl. Math., 2022

2021
Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth.
Random Struct. Algorithms, 2021

Triangle-Free Subgraphs of Hypergraphs.
Graphs Comb., 2021


  Loading...