37 citations · 102 across the 20 of their papers we have counts for
5 papers · 1 filter
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…
Extended commonality of paths and cycles via Schur convexity
Jang Soo Kim, Joonkyung Lee
A graph is \emph{common} if the number of monochromatic copies of in a 2-edge-colouring of the complete graph is asymptotically minimised by the random colouring, or…
A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
Seonghyuk Im, Jaehoon Kim, Joonkyung Lee +1
Hypertrees are linear hypergraphs where every two vertices are connected by a unique path. Elliott and Rödl conjectured that for any given , there exists such that the f…
Chi-boundedness of graphs containing no cycles with chords
Joonkyung Lee, Shoham Letzter, Alexey Pokrovskiy
We prove that the family of graphs containing no cycle with exactly -chords is -bounded, for large enough or of form with an integer. This ver…
Common graphs with arbitrary connectivity and chromatic number
Sejin Ko, Joonkyung Lee
A graph is common if the number of monochromatic copies of in a 2-edge-colouring of the complete graph is asymptotically minimised by the random colouring. We prove t…