Publications

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.

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

Forum of Mathematics, sigma 11 (2023)

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

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

43. 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

42. 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)

41. 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

40. 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

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

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

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

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

37. 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

36. 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

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

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

34. 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

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

Discrete Analysis 2020:19, 26 pp.

32. 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

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

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

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

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

29. 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

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

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

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

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

2019

26. 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

25. 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

24. 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

23. 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

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

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

2018

21. 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

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

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

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

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

18. 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

17. 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

16. 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

15. 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

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

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

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

Discrete Applied Mathematics 206 (2016), 65-72

12. Regular subgraphs of uniform hypergraphs,

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

11. 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

10. 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

9. 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

8. 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

7. 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

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

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

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

Discrete Mathematics 322 (2014), 26-30

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

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

2013

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

Discrete Mathematics 313 (2013), 2232-2238

2. 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

Google Sites

Report abuse