Seonghyuk Im

collaborators

3 papers

math.CO2024

Graph with any rational density and no rich subsets of linear size

Seonghyuk Im, Suyun Jiang, Hong Liu +1

A well-known application of the dependent random choice asserts that any $n$ -vertex graph $G$ with positive edge density contains a `rich' vertex subset $U$ of size $n^{1 - o (1)}$ su…

math.CO2023

A bandwidth theorem for graph transversals

Debsoumya Chakraborti, Seonghyuk Im, Jaehoon Kim +1

Given a collection $G = (G_{1}, \dots, G_{h})$ of graphs on the same vertex set $V$ of size $n$ , an $h$ -edge graph $H$ on the vertex set $V$ is a $G$ -transversal if th…

math.CO2022

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 $μ > 0$ , there exists $n_{0}$ such that the f…