SISeonghyuk Im

Seonghyuk Im

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Seonghyuk Im has a total of 28 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Sidorenko’s conjecture for subdivisions and theta substitutions

    by Seonghyuk Im, Ruonan Li, Hong Liu

    The famous Sidorenko’s conjecture asserts that for every bipartite graph $H$ , the number of homomorphisms from $H$ to a graph $G$ with given edge density is minimised when $G$ is pseudorandom. We prove that for any graph $H$ , a graph obtained from replacing edges of $H$ by generalised theta graphs consisting of even paths satisfies Sidorenko’s conjecture, provided a certain divisibility condition on the number of paths. To achieve this, we prove unconditionally that bipartite graphs obtained from replacing each edge of a complete graph with a generalised theta graph satisfy Sidorenko’s conjecture, which extends a result of Conlon, Kim, Lee and Lee [J. Lond. Math. Soc., 2018].


  • Open Access

    Perturbation of dense graphs

    by Jie Han, Seonghyuk Im, Bin Wang, Junxue Zhang

    In the past two decades, various properties of randomly perturbed/augmented (hyper)graphs have been intensively studied, since the model was introduced by Bohman, Frieze and Martin in 2003. The model usually considers a deterministic graph $G$ with minimum degree condition, perturbed/augmented by a binomial random graph $G(n,p)$ on the same vertex set. In this paper, we show that for many problems of finding spanning subgraphs, one can indeed relax the minimum degree condition to a density condition. This includes the embedding problem for $F$-factors when $F$ is not a forest, graphs with bounded maximum degree, $r$-th power of $k$-uniform tight Hamilton cycles for $r,k\ge 2$, and $k$-uniform Hamilton $\ell$-cycles for $\ell\in[2,k-1]$. These results strengthen the results of Balogh, Treglown, and Wagner, of Böttcher, Montgomery, Parczyk, and Person, and of Chang, Han and Thoma.

  • Open Access

    Unbounded degree spanning hypertrees in Dirac hypergraphs

    by Yaobin Chen, Seonghyuk Im, Junchi Zhang

    In 2001, Komlós, Sárközy, and Szemerédi proved that every sufficiently large $n$-vertex graph with minimum degree at least $\left(1/2+γ\right)n$ contains all spanning trees with maximum degree at most $cn/\log n$. We extend this result to hypergraphs by considering loose hypertrees, which are linear hypergraphs obtained by successively adding edges that share exactly one vertex with a previous edge. For all $k > \ell \geq 2$, we determine asymptotically optimal $\ell$-degree conditions that ensure the existence of all rooted spanning loose hypertrees, without any degree condition, in terms of the $(\ell-1)$-degree threshold for the existence of a perfect matching in $(k-1)$-graphs. As a corollary, we also asymptotically determine the $\ell$-degree threshold for the existence of bounded degree spanning loose hypertrees in $k$-graphs for $k/2 < \ell < k$, confirming a conjecture of Pehova and Petrova in this range. In our proof, we avoid the use of Szemerédi's regularity lemma.

  • Open Access

    On Rainbow Turán Densities of Trees

    by Seonghyuk Im, Jaehoon Kim, Hyunwoo Lee, Haesong Seo

    For a given collection of graphs on a common vertex set , which we call a graph system, a graph on a vertex set is called a rainbow subgraph of if there exists an injective function such that for each . The maximum value of over ‐vertex graph systems having no rainbow subgraph isomorphic to is called the rainbow Turán number of . In this article, we study the rainbow Turán density of a tree . While the classical Turán density of a graph lies in the set , the rainbow Turán density exhibits different behaviors because it can even be an irrational number. Nevertheless, we conjecture that the rainbow Turán density is always an algebraic number. We provide evidence for this conjecture by proving that the rainbow Turán density of a tree is an algebraic number. To show this, we identify the structure of extremal graphs for rainbow trees. Moreover, we further determine all tuples such that every graph system satisfying contains all rainbow ‐edge trees. In the course of proving these results, we also develop the theory on the limit of graph systems.


  • Open Access

    On high discrepancy $1$-factorizations of complete graphs

    by Jiangdong Ai, Fankang He, Seonghyuk Im, Hyunwoo Lee

    We proved that for every sufficiently large $n$, the complete graph $K_{2n}$ with an arbitrary edge signing $σ: E(K_{2n}) \to \{-1, +1\}$ admits a high discrepancy $1$-factor decomposition. That is, there exists a universal constant $c > 0$ such that every edge-signed $K_{2n}$ has a perfect matching decomposition $\{ψ_1, \ldots, ψ_{2n-1}\}$, where for each perfect matching $ψ_i$, the discrepancy $\lvert \frac{1}{n} \sum_{e\in E(ψ_i)} σ(e) \rvert$ is at least $c$.

  • Crux, space constraints and subdivisions

    by Seonghyuk Im, Jaehoon Kim, Younjin Kim, Hong Liu


  • Open Access

    A proof of the Elliott–Rödl conjecture on hypertrees in Steiner triple systems

    by Seonghyuk Im, Jaehoon Kim, Joonkyung Lee, Abhishek Methuku

    Hypertrees are linear hypergraphs where every two vertices are connected by a unique path. Elliott and Rödl conjectured that for any given $\mu>0$ , there exists $n_0$ such that the following holds. Every n-vertex Steiner triple system contains all hypertrees with at most $(1-\mu )n$ vertices whenever $n\geq n_0$ . We prove this conjecture.


  • Open Access

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

    by Seonghyuk Im, Suyun Jiang, Hong Liu, Tuan Tran

    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)}$ such that every pair of vertices in $U$ has at least $n^{1-o(1)}$ common neighbors. In 2003, using a beautiful construction on hypercube, Kostochka and Sudakov showed that this is tight: one cannot remove the $o(1)$ terms even if the edge density of $G$ is $1/2$. In this paper, we generalize their result from pairs to tuples. To be precise, we show that given every pair of positive integers $p<q$, there is an $n$-vertex graph $G$ for all sufficiently large $n$ with edge density $p/q$ such that any vertex subset $U$ of size $Ω(n)$ contains $q$ vertices, any $p+1$ of which have $o(n)$ common neighbors. The edge density $p/q$ is best possible. Our construction uses isoperimetry and concentration of measure on high dimensional complex spheres.

  • Open Access

    Crux, space constraints and subdivisions

    by Seonghyuk Im, Jaehoon Kim, Younjin Kim, Hong Liu

    For a given graph $H$, its subdivisions carry the same topological structure. The existence of $H$-subdivisions within a graph $G$ has deep connections with topological, structural and extremal properties of $G$. One prominent example of such a connection, due to Bollob\'{a}s and Thomason and independently Koml\'os and Szemer\'edi, asserts that the average degree of $G$ being $d$ ensures a $K_{\Omega(\sqrt{d})}$-subdivision in $G$. Although this square-root bound is best possible, various results showed that much larger clique subdivisions can be found in a graph for many natural classes. We investigate the connection between crux, a notion capturing the essential order of a graph, and the existence of large clique subdivisions. This reveals the unifying cause underpinning all those improvements for various classes of graphs studied. Roughly speaking, when embedding subdivisions, natural space constraints arise; and such space constraints can be measured via crux. Our main result gives an asymptotically optimal bound on the size of a largest clique subdivision in a generic graph $G$, which is determined by both its average degree and its crux size. As corollaries, we obtain (1) a characterisation of extremal graphs for which the square-root bound above is tight: they are essentially disjoint unions of graphs having crux size linear in $d$; (2) a unifying approach to find a clique subdivision of almost optimal size in graphs which do not contain a fixed bipartite graph as a subgraph; (3) and that the clique subdivision size in random graphs $G(n,p)$ witnesses a dichotomy: when $p = \omega(n^{-1/2})$, the barrier is the space, while when $p=o( n^{-1/2})$, the bottleneck is the density.

  • Open Access

    Crux, space constraints and subdivisions

    by Seonghyuk Im, Jaehoon Kim, Younjin Kim, Hong Liu

    The existence of $H$-subdivisions within a graph $G$ has deep connections with topological, structural and extremal properties of $G$. One prominent example of such a connection, due to Bollob\'{a}s and Thomason and independently Koml\'os and Szemer\'edi, asserts that the average degree of $G$ being $d$ ensures a $K_{\Omega(\sqrt{d})}$-subdivision in $G$. Although this square-root bound is the best possible, various results showed that much larger clique subdivisions can be found in a graph for many natural classes. We investigate the connection between crux, a notion capturing the essential order of a graph, and the existence of large clique subdivisions. Our main result gives an asymptotically optimal bound on the size of a largest clique subdivision in a generic graph $G$, which is determined by both its average degree and its crux size. As corollaries, we obtain \begin{itemize} \item a characterisation of extremal graphs for which the square-root bound above is tight: they are essentially a disjoint union of graphs each of which has the crux size linear in $d$; \item a unifying approach to find a clique subdivision of almost optimal size in graphs which do not contain a fixed bipartite graph as a subgraph; \item and that the clique subdivision size in random graphs $G(n,p)$ witnesses a dichotomy: when $p = \omega(n^{-1/2})$, the barrier is the space, while when $p=o( n^{-1/2})$, the bottleneck is the density. \end{itemize}