Publications

Preprints submitted

• Optimal bounds on the polynomial Schur's theorem (with Hong Liu and Péter Pál Pach), 24 pages

• Ore-type conditions for existence of a jellyfish in a graph (with Alexandr V. Kostochka and Ruth Ruo), 21 pages

• On the (k+2,k)-problem of Brown, Erdős and Sós for k=5,6,7 (with Stefan Glock, Lyuben Lichev, Oleg Pikhurko and Shumin Sun), 44 pages

•  Extremal density for subdivisions with length or sparsity constraints (with Hong Liu, Yantao Tang, Guanghui Wang, Donglei Yang and Fan Yang), 34 pages

•  Dense triangle-free (n,d,λ)-graphs for all orders (with Hyunwoo Lee), 9 pages

•  On rainbow Turán densities of trees (with Seonghyuk Im, Hyunwoo Lee and Haesong Seo), 24 pages

•  Hamilton transversals in tournaments (with  Debsoumya Chakraborti, Hyunwoo Lee and Jaehyeon Seo), 15 pages

•  Covering multigraphs with bipartite graphs (with  Hyunwoo Lee), 13 pages

•  A bandwidth theorem for graph transversals (with Debsoumya Chakraborti, Seonghyuk Im and Hong Liu), 30 pages

•  On the combinatorics of F_1-representations of pseudotree quivers, (with Jaiung Jun and Alex Sistko), 26 pages

•  Crux, space constraints and subdivisions (with Seonghyuk Im, Younjin Kim and Hong Liu), 37 pages

•   Fragile minor-monotone parameters under random edge perturbation (with Dong Yeap Kang, Mihyun Kang and Sang-il Oum), 19 pages

•   A characterization of testable hypergraph properties (with Felix Joos, Daniela Kühn and Deryk Osthus), 39 pages, we split the original paper into this and the other paper. An extended abstract of the original paper appears in FOCS 2017. 

Preprints accepted

•  On the spectral radius of graphs with given maximum degree and girth (with Jiangdong Ai, Seonghyuk Im, Hyunwoo Lee, Suil O and Liwen Zhang), 12 pages, to appear in Linear algebra and its applications

•  A proof of Elliot-Rödl conjecture on hypertrees in Steiner triple systems (with Seonghyuk Im, Joonkyung Lee, Abhishek Methuku), 19 pages

to appear in Forum of Mathematics, sigma

•  Conflict-free hypergraph matchings (with  Stefan Glock, Felix Joos, Marcus Kühn and Lyuben Lichev), 58 pages, an extended abstract of this paper appears in SODA23, to appear in Journal of the London Mathematical Society

•  New lower bounds on kissing numbers and spherical codes in high dimensions (with Irene Gil Fernández, Hong Liu and Oleg Pikhurko), 

to appear in American Journal of Mathematics, 20 pages

•  Rainbow cycles in properly edge-colored graphs (with Joonkyung Lee, Hong Liu and Tuan Tran), 

to appear in Combinatorica, 9 pages

•  On the (6,4)-problem of Brown, Erdős and Sós (with  Stefan Glock, Felix Joos, Marcus Kühn, Lyuben Lichev and Oleg Pikhurko), 

to appear in Proceedings of the American Mathematical Society, 11 pages

2024

•  On a rainbow extremal problem for color-critical graphs (with  Debsoumya Chakraborti, Hyunwoo Lee, Hong Liu and Jaehyeon Seo),

Random Structures and Algorithms 64(2) (2024), 460-489 

2023

• A proof of Frankl's conjecture on cross-union families (with Stijn Cambie, Hong Liu and Tuan Tran), 

Combinatorial Theory 3 (2) (2023), #9.

• Embedding clique-factors in graphs with low ℓ-independence number, (with Fan Chang, Jie Han, Guanghui Wang, Donglei Yang), 

Journal of Combinatorial Theory Series B 161 (2023), 301-330

•  Exponential decay of intersection volume with applications on list-decodability and Gilbert-Varshamov type bound (with Hong Liu and Tuan Tran),  

IEEE Transactions on Information Theory 19(5) (2023), 2841-2854

•  Hypergraph regularity and random sampling (with Felix Joos, Daniela Kühn and Deryk Osthus), 

Random Structures and Algorithms 62(4) (2023), 956-1015,  we split the original paper into this and the other paper.  An extended abstract of the original paper appears in FOCS 2017. 

•  Ramsey numbers of cycles versus general graphs (with John Haslegrave, Joseph Hyde and Hong Liu), 

Forum of Mathematics, sigma 11 (2023)

•  2-complexes with unique embeddings in 3-space (with Agelos Georgakopoulos), 

Bulletin of the London Mathematical Society 55 (2023), 156-174

•  A Sharp lower bound for the spectral radius in K_4-saturated graphs (with Alexandr V. Kostochka, Suil O, Yongtang Shi and Zhiwen Wang), 

Discrete Mathematics 346(2) (2023) 113231

2022

• Fractional Helly theorem for Cartesian products of convex sets (with  Debsoumya Chakraborti, Jinha Kim, Minki Kim and Hong Liu), 

Discrete and Computational Geometry (2022)

•  Crux and long cycles in graphs (with  John Haslegrave, Jie Hu, Hong Liu, Bingyu Luan and Guanghui Wang), 

SIAM Journal on Discrete Mathematics 36(4) (2022)

•  Extremal density for sparse minors and subdivisions (with John Haslegrave and Hong Liu), 

International Mathematics Research Notices Volume 2022, issue 20, October 2022, 15505-15548

•  Well-mixing vertices and almost expanders (with  Debsoumya Chakraborti, Jinha Kim, Minki Kim and Hong Liu), 

Proceedings of the American Mathematical Society 150(12) (2022), 5097-5110

•  On 1-subdivisions of transitive tournaments (with Hyunwoo Lee and Jaehyeon Seo), 

Electronic Journal of Combinatorics 29(1) (2022), #P1.51

•  Nested cycles with no geometric crossings (with Irene Gil Fernández, Younjin Kim and Hong Liu), 

Proceedings of American Mathematical Society 9(2022) 22-32

•  A Cvektovic-type  theorem for coloring of digraphs (with Soyeon Kim, Suil O and Semin Oh), 

Linear Algebra and its Applications 643(2022) 30-36

2021

•  Resolution of the Oberwolfach problem (with Stefan Glock, Felix Joos, Daniela Kühn and Deryk Osthus ), 

Journal of the European Mathematical Society 23 (2021), 2511-2547

•  On the rational Turán exponents conjecture (with Dong Yeap Kang and Hong Liu),  

Journal of Combinatorial Theory Series B, 148 (2021) 149-172

•  The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor (with Sang-il Oum), 

Electronic Journal of Combinatorics 28(2) (2021), #P2.9

2020

•  Asymptotic structure for the clique density theorem (with Hong Liu, Oleg Pikhurko and Maryam Sharifzadeh), 

Discrete Analysis 2020:19, 26 pp.

•  The minimum spectral radius of K_{r+1}-saturated graph, (with Seog-jin Kim,  Alexandr V. Kostochka, and Suil O), 

Discrete Mathematics 343 (2020) 112068

•  Tree decompositions of graphs without large bipartite holes (with Younjin Kim and Hong Liu), 

Random Structures and Algorithms 57 (2020), 150-168

•  On a rainbow version of Dirac's theorem (with Felix Joos), 

Bulletin of the London Mathematical Society 56 (2020), 498-504

•  Rainbow structures in locally bounded colourings of graphs (with Daniela Kühn, Andrey Kupavskii and Deryk Osthus), 

Random Structures and Algorithms 56 (2020), 1171-1204

•  On 1-factors with prescribed lengths in tournaments (with Dong Yeap Kang), 

Journal of Combinatorial Theory Series B 141 (2020), 31-71

•  Spanning trees in randomly perturbed graphs (with Felix Joos), 

Random Structures and Algorithms 56 (2020), 169-219

2019

•  Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs (with Padraig Condon, Alberto Espuny Díaz, Daniela Kühn and Deryk Osthus), 

Electronic Journal of Combinatorics 26(4) (2019), #P4.54

•  Optimal packings of bounded degree trees (with Felix Joos, Daniela Kühn and Deryk Osthus), 

Journal of the European Mathematical Society 21 (2020), 3573-3647

•  A bandwidth theorem for approximate decompositions (with Padraig Condon, Daniela Kühn and Deryk Osthus), 

Proceedings of the London Mathematical Society 118 (2019), 1393-1449 

•  A blow-up lemma for approximate decompositions (with Daniela Kühn, Deryk Osthus and Mykhaylo Tyomkyn), 

Transactions of the American Mathematical Society 371 (2019), 4655-4742 

•  Two conjectures in Ramsey-Turán theory (with Younjin Kim  and Hong Liu), 

SIAM Journal on Discrete Mathematics 33(1) (2019), 564–586 

2018

•  Forbidding induced even cycles in a graph: typical structure and counting, (with Daniela Kühn, Deryk Osthus and Timothy Townsend), 

Journal of Combinatorial Theory Series B 131 (2018), 170-219

•  Dynamic choosability of triangle-free graphs and sparse random graphs, (with Seongmin Ok), 

Journal of Graph Theory 87 (2018), 347-355

•  Two-regular subgraphs of odd-uniform hypergraphs, (with Jie Han), 

Journal of Combinatorial Theory Series B 128 (2018), 175-191

•  Strong edge-colorings of sparse graphs with large maximum degree, (with Ilkyoo Choi, Alexandr V. Kostochka and André  Raspaud), 

European Journal of Combinatorics 67 (2018), 21-39

2017

•  Proof of Komlós's conjecture on Hamiltonian subsets, (with Hong Liu, Maryam Sharifzadeh and Katherine Staden), 

Proceedings of the London Mathematical Society 115(5) (2017), 974-1013

•  Sparse spanning k-connected subgraphs in tournaments, (with Dong Yeap Kang, Younjin Kim and Geewon Suh), 

SIAM Journal on Discrete Mathematics 31(3) (2017), 2206-2227

•  On the number of r-matchings in a tree, (with Dong Yeap Kang, Younjin Kim and Hiu-Fai Law), 

Electronic Journal of Combinatorics 24(1) (2017), #P1.24

2016

•  Bipartitions of highly connected tournaments, (with Daniela Kühn and Deryk Osthus), 

SIAM Journal on Discrete Mathematics 30(2) (2016), 895-911

•  On r-dynamic coloring of graphs, (with Sogol Jahanbekam, Suil O and Douglas West), 

Discrete Applied Mathematics 206 (2016), 65-72

•  Regular subgraphs of uniform hypergraphs, 

Journal of Combinatorial Theory Series B 119 (2016), 214-236

•  Improper coloring of sparse graphs with a given girth, II: constructions, (with Alexandr V. Kostochka and Xuding Zhu), 

Journal of Graph Theory 81 (2016), 403-413

•  The difference and ratio of the fractional matching number and the matching number of graphs, (with Ilkyoo Choi and Suil O), 

Discrete Mathematics 339 (2016), 1382-1386

2015

•  A relative of Hadwiger’s conjecture, (with Katherine Edwards, Dong Yeap Kang, Sang-il Oum and Paul Seymour), 

SIAM Journal on Discrete Mathematics 29(4) (2015), 2385-2388

•  On the Erdős-Ko-Rado Theorem and Bollobás theorem for t-intersecting families, (with Dong Yeap Kang, Younjin Kim ), 

European Journal of Combinatorics 47 (2015), 68-74

2014

•  Improper coloring of sparse graphs with a given girth, I: (0,1)-colorings of triangle-free graphs, (with Alexandr V. Kostochka and Xuding Zhu), 

European Journal of Combinatorics 42 (2014), 26-48

•  Equicovering subgraphs of graphs and hypergraphs, (with Ilkyoo Choi, Amelia Tebbe and Douglas West), 

Electronic Journal of Combinatorics 21(1) (2014), #P1.62

•  Ramsey-minimal saturation numbers for matchings, (with Michael Ferrara and Elyse Yeager), 

Discrete Mathematics 322 (2014), 26-30

•  Maximum hypergraphs without regular subgraphs, (with Alexandr V. Kostochka), 

Discussiones Mathematicae Graph Theory 34 (2014), 151–166

2013

•  Average connectivity and average edge-connectivity in graphs, (with Suil O), 

Discrete Mathematics 313 (2013), 2232-2238

•  New results in t-tone coloring of graphs, (with Dan Cranston and Bill Kinnersley), 

Electronic Journal of Combinatorics 20(2) (2013), #P17

2012

• Harmonious coloring of trees with large maximum degree, (with Saieed Akbari and Alexandr V. Kostochka), 

Discrete Mathematics 312 (2012), 1633-1637