3 papers
math.CO2019
Hypergraph based Berge hypergraphs
Martin Balko, Daniel Gerbner, Dong Yeap Kang +2
Fix a hypergraph . A hypergraph is called a {\it Berge copy of } or {\it Berge-} if we can choose a subset of each hyperedge of…
math.CO2018
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…