Hyunwoo Lee

collaborators

6 papers

math.CO2026

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…

math.CO2025

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 $L$ in $F_{p}$ is $o (p)$ if and only if the sum of…

math.CO2025

Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions

Nemanja DraganiÄ, Jaehoon Kim, Hyunwoo Lee +3

Dirac's classical theorem asserts that, for $n \geq 3$ , any $n$ -vertex graph with minimum degree at least $n /2$ is Hamiltonian. Furthermore, if we additionally assume that such grap…

math.CO2025

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…

math.CO2025

Spanning subdivisions in dense digraphs

Hyunwoo Lee

We prove that an $n$ -vertex digraph $D$ with minimum semi-degree at least $(\frac{1}{2} + ε) n$ and $n \geq C m$ contains a subdivision of all $m$ -arc digraphs…

math.CO2025

On perfect subdivision tilings

Hyunwoo Lee

For a given graph $H$ , we say that a graph $G$ has a perfect $H$ -subdivision tiling if $G$ contains a collection of vertex-disjoint subdivisions of $H$ covering all vertices of $G.…