34 citations · 63 across the 15 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018★ 1 cited
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…
math.CO2018
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…
math.CO2018★ 2 cited
Sparse highly connected spanning subgraphs in dense directed graphs
Dong Yeap Kang
Mader proved that every strongly -connected -vertex digraph contains a strongly -connected spanning subgraph with at most edges, where the equality holds for…