11 citations · 14 across the 14 of their papers we have counts for
16 papers
Kahn--Lovász-type inequalities for graph factors
Hyunwoo Lee
The Kahn--Lovász theorem gives a sharp upper bound on the number of perfect matchings in a graph in terms of its degree sequence, extending the classical Brégman--Minc inequality f…
Tower heights for color-avoiding Ramsey numbers of monotone paths
Jigang Choi, Hyunwoo Lee, Tuan Tran
Ramsey numbers of monotone paths in ordered hypergraphs form a natural higher-uniformity extension of the classical Erdős--Szekeres theorems, and their tower height was determined…
On a Ramsey--Turán variant of Roth's theorem
Matija Bucić, Micha Christoph, Jaehoon Kim +2
A classical theorem of Roth states that the maximum size of a solution-free set of a homogeneous linear equation in is if and only if the sum of…
Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions
Nemanja Draganić, Jaehoon Kim, Hyunwoo Lee +3
Dirac's classical theorem asserts that, for , any -vertex graph with minimum degree at least is Hamiltonian. Furthermore, if we additionally assume that such grap…
On the order of intersecting hypergraphs
Stijn Cambie, Jaehoon Kim, Hyunwoo Lee +2
Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In…
Transversal cycles and paths in tournaments
Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee +1
Thomason [ 296.1 (1986)] proved that every sufficiently large tournament contains Hamilton paths and cycles with all possible orientations, except…
Dense triangle-free -graphs for all orders
Jaehoon Kim, Hyunwoo Lee
In 1994, Alon construct a triangle-free -graph with and for an exponentially increasing sequence of integers . Using his ingenious cons…
On rainbow Turán Densities of Trees
Seonghyuk Im, Jaehoon Kim, Hyunwoo Lee +1
For a given collection of graphs on a common vertex set , which we call a \emph{graph system}, a graph on a vertex set is…
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…
Spanning subdivisions in dense digraphs
Hyunwoo Lee
We prove that an -vertex digraph with minimum semi-degree at least and contains a subdivision of all -arc digraphs…
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…
On perfect subdivision tilings
Hyunwoo Lee
For a given graph , we say that a graph has a perfect -subdivision tiling if contains a collection of vertex-disjoint subdivisions of covering all vertices of $G.…
On a rainbow extremal problem for color-critical graphs
Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee +2
There has been extensive studies on the following question: given graphs over a common vertex set of size , what conditions on ensures a `colorful' co…
On 1-subdivisions of transitive tournaments
Jaehoon Kim, Hyunwoo Lee, Jaehyeon Seo
The oriented Ramsey number for an acyclic digraph is the minimum integer such that any -vertex tournament contains a copy of as a subgraph. We prove tha…
Optimal solutions and ranks in the max-cut SDP
Daniel Hong, Hyunwoo Lee, Alex Wei
The max-cut problem is a classical graph theory problem which is NP-complete. The best polynomial time approximation scheme relies on \emph{semidefinite programming} (SDP). We stud…
Randomized Computation of Continuous Data: Is Brownian Motion Computable?
Willem Fouché, Hyunwoo Lee, Donghyun Lim +3
We consider randomized computation of continuous data in the sense of Computable Analysis. Our first contribution formally confirms that it is no loss of generality to take as samp…