5 citations · 6 across the 20 of their papers we have counts for
5 papers · 1 filter
Berge Hamilton cycles in a random sparsification of dense hypergraphs
Seonghyuk Im, Minseo Kim
In the standard random graph process, edges are added to an initially empty graph one by one uniformly at random. A classic result by Ajtai, Komlós, and Szemerédi, and independentl…
An efficient algorithm for -subgraph-free Edge Deletion on graphs having a product structure
Shinwoo An, Seonghyuk Im, Seokbeom Kim +1
Given a family of graphs, a graph is \emph{-subgraph-free} if it has no subgraph isomorphic to a member of . We present a fixed-parameter li…
Perturbation of dense graphs
Jie Han, Seonghyuk Im, Bin Wang +1
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…
Unbounded degree spanning hypertrees in Dirac hypergraphs
Yaobin Chen, Seonghyuk Im, Junchi Zhang
In 2001, Komlós, Sárközy, and Szemerédi proved that every sufficiently large -vertex graph with minimum degree at least contains all spanning trees with ma…
On high discrepancy -factorizations of complete graphs
Jiangdong Ai, Fankang He, Seonghyuk Im +1
We proved that for every sufficiently large , the complete graph with an arbitrary edge signing admits a high discrepancy -factor decom…