◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Hyunwoo Lee

16 papers hereh-index 453 citations17 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author3
  • middle author11
  • last author2

Across the 16 of 16 papers where every author was matched, so the position is known.

fields
  • math.CO14
  • math.NA1
  • math.OC1
same name
  • Hyunwoo Lee — 15 papers, h 8
  • Hyunwoo Lee — 14 papers, h 2
  • Hyunwoo Lee — 5 papers, h 2
  • Hyunwoo Lee — 3 papers, h 3
  • Hyunwoo Lee — 3 papers, h 3
  • Hyunwoo Lee — 3 papers, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20192026
most citedOn a rainbow extremal problem for color-critical graphs

11 citations · 14 across the 14 of their papers we have counts for

collaborators
Showing 2023Show all

5 papers · 1 filter

math.CO2023★ 1 cited

On rainbow Turán Densities of Trees

Seonghyuk Im, Jaehoon Kim, Hyunwoo Lee +1

For a given collection G=(G1​,…,Gk​) of graphs on a common vertex set V, which we call a \emph{graph system}, a graph H on a vertex set V(H)⊆V is…

math.CO2023

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…

math.CO2023

Spanning subdivisions in dense digraphs

Hyunwoo Lee

We prove that an n-vertex digraph D with minimum semi-degree at least (21​+ε)n and n≥Cm contains a subdivision of all m-arc digraphs…

math.CO2023

Covering multigraphs with bipartite graphs

Jaehoon Kim, Hyunwoo Lee

Hansel's lemma states that ∑H∈H​∣H∣≥nlog2​n holds where H is a collection of bipartite graphs covering all the edges of Kn​. We generalize…

math.CO2023★ 1 cited

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.…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.