47 citations · 231 across the 46 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
A bandwidth theorem for approximate decompositions
Padraig Condon, Jaehoon Kim, Daniela Kühn +1
We provide a degree condition on a regular -vertex graph which ensures the existence of a near optimal packing of any family of bounded degree -vertex -ch…
math.CO2017★ 5 cited
A characterization of testable hypergraph properties
Felix Joos, Jaehoon Kim, Daniela Kühn +1
We provide a combinatorial characterization of all testable properties of -uniform hypergraphs (-graphs for short). Here, a -graph property is testable if there is a r…
math.CO2017★ 22 cited
Proof of Komlós's conjecture on Hamiltonian subsets
Jaehoon Kim, Hong Liu, Maryam Sharifzadeh +1
Komlós conjectured in 1981 that among all graphs with minimum degree at least , the complete graph minimises the number of Hamiltonian subsets, where a subset of verti…