Accesso pubblico

On r-dynamic coloring of graphs

S Jahanbekam, J Kim, S O, D West

Discrete Applied Mathematics 206, 65-72, 2016

Mandati: Natural Sciences and Engineering Research Council of Canada, European Commission

On a rainbow version of Dirac's theorem

F Joos, J Kim

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

Mandati: German Research Foundation

Optimal packings of bounded degree trees

F Joos, J Kim, D Kühn, D Osthus

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

Mandati: UK Engineering and Physical Sciences Research Council, European Commission

[PDF] ems.press

Resolution of the Oberwolfach problem

S Glock, F Joos, J Kim, D Kühn, D Osthus

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

Mandati: German Research Foundation, UK Engineering and Physical Sciences Research …

A blow-up lemma for approximate decompositions

J Kim, D Kühn, D Osthus, M Tyomkyn

arxiv, 2016

Mandati: UK Engineering and Physical Sciences Research Council, European Commission

Spanning trees in randomly perturbed graphs

F Joos, J Kim

Random Structures & Algorithms 56 (1), 169-219, 2020

Mandati: German Research Foundation, European Commission

[PDF] oup.com

Extremal density for sparse minors and subdivisions

J Haslegrave, J Kim, H Liu

International Mathematics Research Notices 2022 (20), 15505-15548, 2022

Mandati: UK Research & Innovation

Rainbow structures in locally bounded colorings of graphs

J Kim, D Kühn, A Kupavskii, D Osthus

Random Structures & Algorithms 56 (4), 1171-1204, 2020

Mandati: UK Engineering and Physical Sciences Research Council, Royal Society UK

Proof of Komlós's conjecture on Hamiltonian subsets

J Kim, H Liu, M Sharifzadeh, K Staden

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

Mandati: UK Engineering and Physical Sciences Research Council, European Commission

[PDF] warwick.ac.uk

A bandwidth theorem for approximate decompositions

P Condon, J Kim, D Kühn, D Osthus

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

Mandati: UK Engineering and Physical Sciences Research Council, European Commission

Nested cycles with no geometric crossings

I Fernández, J Kim, Y Kim, H Liu

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

Mandati: UK Research & Innovation

Strong edge-colorings of sparse graphs with large maximum degree

I Choi, J Kim, AV Kostochka, A Raspaud

European Journal of Combinatorics 67, 21-39, 2018

Mandati: US National Science Foundation, European Commission

[PDF] illinois.edu

Improper coloring of sparse graphs with a given girth, II: constructions

J Kim, AV Kostochka, X Zhu

J. Graph Theory 81 (4), 403-413, 2016

Mandati: US National Science Foundation, National Natural Science Foundation of China

[PDF] researchgate.net

On the (6, 4)-problem of Brown, Erdős, and Sós

S Glock, F Joos, J Kim, M Kühn, L Lichev, O Pikhurko

Proceedings of the American Mathematical Society, Series B 11 (17), 173-186, 2024

Mandati: European Commission

Crux and long cycles in graphs

J Haslegrave, J Hu, J Kim, H Liu, B Luan, G Wang

SIAM Journal on Discrete Mathematics 36 (4), 2942-2958, 2022

Mandati: National Natural Science Foundation of China, UK Research & Innovation

[PDF] cambridge.org

Ramsey numbers of cycles versus general graphs

J Haslegrave, J Hyde, J Kim, H Liu

Forum of Mathematics, Sigma 11, e10, 2023

Mandati: European Commission, UK Research & Innovation

The difference and ratio of the fractional matching number and the matching number of graphs

I Choi, J Kim, S O

Discrete Mathematics 339 (4), 1382-1386, 2016

Mandati: European Commission

On the Erdős–Ko–Rado theorem and the Bollobás theorem for t-intersecting families

DY Kang, J Kim, K Younjin

European Journal of Combinatorics 47, 68-74, 2015

Mandati: European Commission

On a rainbow extremal problem for color‐critical graphs

D Chakraborti, J Kim, H Lee, H Liu, J Seo

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

Mandati: UK Research & Innovation

[PDF] warwick.ac.uk