47 citations · 231 across the 46 of their papers we have counts for
50 papers
Hamilton transversals in tournaments
Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee +1
It is well-known that every tournament contains a Hamilton path, and every strongly connected tournament contains a Hamilton cycle. This paper establishes transversal generalizatio…
Covering multigraphs with bipartite graphs
Jaehoon Kim, Hyunwoo Lee
Hansel's lemma states that holds where is a collection of bipartite graphs covering all the edges of . We generalize…
A bandwidth theorem for graph transversals
Debsoumya Chakraborti, Seonghyuk Im, Jaehoon Kim +1
Given a collection of graphs on the same vertex set of size , an -edge graph on the vertex set is a -transversal if th…
On the Combinatorics of -Representations of Pseudotree Quivers
Jaiung Jun, Jaehoon Kim, Alex Sistko
We investigate quiver representations over . Coefficient quivers are combinatorial gadgets equivalent to -representations of quivers. We focus on the ca…
Rainbow cycles in properly edge-colored graphs
Jaehoon Kim, Joonkyung Lee, Hong Liu +1
We prove that every properly edge-colored -vertex graph with average degree at least contains a rainbow cycle, improving upon bound due to To…
On the -problem of Brown, Erdős and Sós
Stefan Glock, Felix Joos, Jaehoon Kim +3
Let be the maximum number of edges of an -uniform hypergraph on vertices not containing a subgraph with edges and at most vertices. In 1973, Brown,…