Jiaxi Nie

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	The Number of Edge Colorings with Small Independence Number and No Monochromatic $H$	2025	Xinyu Hu Qizhong Lin Jiaxi Nie
+	Off‐Diagonal Ramsey Numbers for Slowly Growing Hypergraphs	2025	Sam Mattheus Dhruv Mubayi Jiaxi Nie Jacques Verstraëte
+ PDF Chat	On tight tree-complete hypergraph Ramsey numbers	2024	Jiaxi Nie
+ PDF Chat	Random Tur\'an Problems for $K_{s,t}$ Expansions	2024	Jiaxi Nie Sam Spiro
+ PDF Chat	On the Matching Problem in Random Hypergraphs	2024	Péter Frankl Jiaxi Nie Jian Wang
+ PDF Chat	Off-diagonal Ramsey numbers for slowly growing hypergraphs	2024	Sam Mattheus Dhruv Mubayi Jiaxi Nie Jacques Verstraëte
+ PDF Chat	On odd covers of cliques and disjoint unions	2024	Calum Buchanan Alexander Clifton Eric Culver Péter Frankl Jiaxi Nie Kenta Ozeki Puck Rombach Mei Yin
+ PDF Chat	Random Tur\'an Problems for Hypergraph Expansions	2024	Jiaxi Nie Sam Spiro
+	Turán theorems for even cycles in random hypergraph	2024	Jiaxi Nie
+	On asymptotic local Turán problems	2023	Péter Frankl Jiaxi Nie
+ PDF Chat	On asymptotic packing of convex geometric and ordered graphs	2023	Jiaxi Nie Erlang Surya Ji Zeng
+ PDF Chat	Odd covers of graphs	2023	Calum Buchanan Alexander Clifton Eric Culver Jiaxi Nie Jason O’Neill Puck Rombach Mei Yin
+	On asymptotic local Turán problems	2023	Péter Frankl Jiaxi Nie
+	Turán theorems for even cycles in random hypergraph	2023	Jiaxi Nie
+	Random Turán theorem for expansions of spanning subgraphs of tight trees	2023	Jiaxi Nie
+	Random Turán and counting results for general position sets over finite fields	2023	Yaobin Chen Xizhi Liu Jiaxi Nie Ji Zeng
+	Sidorenko Hypergraphs and Random Turán Numbers	2023	Jiaxi Nie Sam Spiro
+ PDF Chat	On asymptotic packing of geometric graphs	2022	Daniel W. Cranston Jiaxi Nie Jacques Verstraëte Alexandra Wesolek
+ PDF Chat	Maximal independent sets in clique-free graphs	2022	Xiaoyu He Jiaxi Nie Sam Spiro
+ PDF Chat	Ramsey Numbers for Nontrivial Berge Cycles	2022	Jiaxi Nie Jacques Verstraëte
+	On Turán numbers for disconnected hypergraphs	2022	Raffaella Mulas Jiaxi Nie
+	On asymptotic packing of convex geometric and ordered graphs	2022	Jiaxi Nie Erlang Surya Ji Zeng
+	Odd Covers of Graphs	2022	Calum Buchanan Alexander Clifton Eric Culver Jiaxi Nie Jason O’Neill Puck Rombach Mei Yin
+ PDF Chat	Triangle-Free Subgraphs of Hypergraphs	2021	Jiaxi Nie Sam Spiro Jacques Verstraëte
+ PDF Chat	Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth	2021	Jiaxi Nie Jacques Verstraëte
+	Ramsey Numbers for Non-trivial Berge Cycles	2021	Jiaxi Nie Jacques Verstraëte
+	On Asymptotic Packing of Geometric Graphs	2021	Daniel W. Cranston Jiaxi Nie Jacques Verstraëte Alexandra Wesolek
+	Maximal independent sets in clique-free graphs	2021	Xiaoyu He Jiaxi Nie Sam Spiro
+	Triangle-free Subgraphs of Hypergraphs	2020	Jiaxi Nie Sam Spiro Jacques Verstraëte
+	Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth	2020	Jiaxi Nie Jacques Verstraëte

Common Coauthors

Coauthor	Papers Together
Jacques Verstraëte	10
Sam Spiro	7
Péter Frankl	4
Eric Culver	3
Puck Rombach	3
Alexander Clifton	3
Mei Yin	3
Ji Zeng	3
Calum Buchanan	3
Alexandra Wesolek	2
Jason O’Neill	2
Sam Mattheus	2
Daniel W. Cranston	2
Erlang Surya	2
Dhruv Mubayi	2
Yaobin Chen	1
Xiaoyu He	1
Qizhong Lin	1
Kenta Ozeki	1
Xinyu Hu	1
Raffaella Mulas	1
Jian Wang	1
Xiaoyu He	1
Xizhi Liu	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	A note on Ramsey numbers	1980	Miklós Ajtai János Komlós Endre Szemerédi	5
+	A note on the independence number of triangle-free graphs	1983	James B. Shearer	5
+	The number of C2-free graphs	2016	Robert Morris David Saxton	5
+	Hypergraph Turán numbers of linear cycles	2014	Zoltán Füredi Tao Jiang	3
+ PDF Chat	Extremal results for random discrete structures	2016	Mathias Schacht	3
+	The number of hypergraphs without linear cycles	2018	József Balogh Bhargav Narayanan Jozef Skokan	3
+ PDF Chat	On an extremal problem in graph theory	1964	Péter L. Erdős	3
+ PDF Chat	Compactness results in extremal graph theory	1982	Paul Erdős Miklós Simonovits	3
+	Asymptotic packing and the random greedy algorithm	1996	Vojt ch R�dl Lubo Thoma	3
+ PDF Chat	Hypergraph containers	2015	David Saxton Andrew Thomason	3
+	OnK 4-free subgraphs of random graphs	1997	Yoshiharu Kohayakawa Tomasz Łuczak V. Rödl	3
+ PDF Chat	INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS	1961	Péter L. Erdős Chao Ko R. Rado	3
+	Hypergraph Ramsey numbers: Triangles versus cliques	2013	Alexandr Kostochka Dhruv Mubayi Jacques Verstraëte	3
+ PDF Chat	Combinatorial theorems in sparse random sets	2016	David Conlon W. T. Gowers	3
+	The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent	1986	Péter L. Erdős Péter Frankl V. Rödl	3
+	Turán problems and shadows I: Paths and cycles	2014	Alexandr Kostochka Dhruv Mubayi Jacques Verstraëte	3
+	The number of <i>K</i> <sub> <i>s,t</i> </sub> -free graphs	2011	József Balogh Wojciech Samotij	3
+ PDF Chat	New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs	2012	Kunal Dutta Dhruv Mubayi C. R. Subramanian	2
+	The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)	2020	Gonzalo Fiz Pontiveros Simon Griffiths Robert Morris	2
+ PDF Chat	Mantel's theorem for random graphs	2014	Bobby DeMarco J. Kahn	2
+ PDF Chat	The Ramsey number of loose cycles versus cliques	2018	Arès Méroueh	2
+	Packing plane spanning trees into a point set	2020	Ahmad Biniaz Alfredo Garcı́a	2
+	A note on the independence number of triangle-free graphs, II	1991	James B. Shearer	2
+	The book thickness of a graph	1979	Frank R. Bernhart Paul C. Kainen	2
+ PDF Chat	Large Subgraphs without Short Cycles	2015	Florent Foucaud Michael Krivelevich Guillem Perarnau	2
+ PDF Chat	On the triangle space of a random graph	2013	Bobby DeMarco Andreas Hamm J. Kahn	2
+	An Extremal Theorem in the Hypercube	2010	David Conlon	2
+ PDF Chat	Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections	2009	David Gamarnik David A. Goldberg	2
+	Rainbow Turán problem for even cycles	2013	Shagnik Das Choongbum Lee Benny Sudakov	2
+	Hypergraphs with no odd cycle of given length	2009	Ervin Győri Nathan Lemons	2
+	Partitions of complete geometric graphs into plane trees	2005	Prosenjit Bose Ferrán Hurtado Eduardo Rivera‐Campo David R. Wood	2
+ PDF Chat	On Hypergraphs of Girth Five	2003	Felix Lazebnik Jacques Verstraëte	2
+ PDF Chat	On the combinatorial problems which I would most like to see solved	1981	P. Erdős	2
+	The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i>	1995	Jeong Han Kim	2
+	Cycles of even length in graphs	1974	J. A. Bondy Miklós Simonovits	2
+	Independent sets in hypergraphs	2014	József Balogh Robert Morris Wojciech Samotij	2
+ PDF Chat	A Note on Odd Cycle-Complete Graph Ramsey Numbers	2001	Benny Sudakov	2
+	Exact solution of some Turán-type problems	1987	Péter Frankl Zoltán Füredi	2
+	Pentagons vs. triangles	2007	Béla Bollobás Ervin Győri	2
+	Extremal uncrowded hypergraphs	1982	Miklós Ajtai János Komlós J. Pintz J. Spencer Endre Szemerédi	2
+	None	2011	J.L. Rami ́rez Alfonsi ́n Sándor Z. Kiss Imre Z. Ruzsa Carlos Vinuesa	2
+	On uncrowded hypergraphs	1995	Richard A. Duke Hanno Lefmann Vojtěch Rödl	2
+	3-uniform hypergraphs avoiding a given odd cycle	2012	Ervin Győri Nathan Lemons	2
+	On Sequences of Numbers not Divisible one by another	1935	Felix Behrend	2
+ PDF Chat	Minimal Regular Graphs of Girths Eight and Twelve	1966	Clark T. Benson	2
+	An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth	1998	Yoshiharu Kohayakawa B. Kreuter Angelika Steger	2
+	Improved lower bounds on <i>k</i>‐independence	1991	Yair Caro Źsolt Tuza	2
+	On Certain Sets of Integers	1953	K. F. Roth	2
+	Asymptotic bounds for some bipartite graph: complete graph Ramsey numbers	2000	Yair Caro Yusheng Li Cecil Rousseau Yuming Zhang	2
+	Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers	2017	Clayton Collier-Cartaino Nathan Graber Tao Jiang	2