Seonghyuk Im

Orcid: 0000-0003-1996-6801

According to our database¹, Seonghyuk Im authored at least 6 papers between 2016 and 2025.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2025

Dirac's Theorem for Linear Hypergraphs.

[BibT_eX]

[DOI]

Seonghyuk Im

Hyunwoo Lee

SIAM J. Discret. Math., 2025

On Rainbow Turán Densities of Trees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2025

Crux, space constraints and subdivisions.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2025

The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs.

[BibT_eX]

[DOI]

Jungho Ahn

Seonghyuk Im

Sang-il Oum

Discret. Appl. Math., 2025

2018

Complexity of Partitioning Hypergraphs.

[BibT_eX]

[DOI]

Seonghyuk Im

CoRR, 2018

2016

On the mean square displacement of a random walk on a graph.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

Seonghyuk Im

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...