47 citations · 231 across the 46 of their papers we have counts for
8 papers · 1 filter
On the rational Turán exponents conjecture
Dong Yeap Kang, Jaehoon Kim, Hong Liu
The extremal number of a graph is the maximum number of edges in an -vertex graph not containing as a subgraph. A real number is realisa…
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs
Padraig Condon, Alberto Espuny Díaz, Jaehoon Kim +2
Pósa's theorem states that any graph whose degree sequence satisfies for all has a Hamilton cycle. This degree condition is bes…
Tree decompositions of graphs without large bipartite holes
Jaehoon Kim, Younjin Kim, Hong Liu
A recent result of Condon, Kim, Kühn and Osthus implies that for any , an -vertex almost -regular graph has an approximate decomposition into a…
Resolution of the Oberwolfach problem
Stefan Glock, Felix Joos, Jaehoon Kim +2
The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of into edge-disjoint copies of a given -factor. We show that this can be achieved for all…
Rainbow structures in locally bounded colourings of graphs
Jaehoon Kim, Daniela Kühn, Andrey Kupavskii +1
We prove several results on approximate decompositions of edge-coloured quasirandom graphs into rainbow spanning structures. More precisely, we say that an edge-colouring of a grap…
Spanning trees in randomly perturbed graphs
Felix Joos, Jaehoon Kim
A classical result of Komlós, Sárközy and Szemerédi states that every -vertex graph with minimum degree at least contains every -vertex tree with maximum degre…
Two conjectures in Ramsey-Turán theory
Jaehoon Kim, Younjin Kim, Hong Liu
Given graphs , a graph is -free if there is a -edge-colouring with no monochromatic copy of with edges of c…
On 1-factors with prescribed lengths in tournaments
Dong Yeap Kang, Jaehoon Kim
Kühn, Osthus, and Townsend asked whether there exists a constant such that every strongly -connected tournament contains all possible -factors with at most component…