5 citations · 6 across the 20 of their papers we have counts for
4 papers · 1 filter
Ramsey--Dirac theory for bounded degree hypertrees
Jie Han, Seonghyuk Im, Jaehoon Kim +1
Ramsey--Turán theory considers Turán type questions in Ramsey-context, asking for the existence of a small subgraph in a graph where the complement lacks an appr…
Sidorenko's conjecture for subdivisions and theta substitutions
Seonghyuk Im, Ruonan Li, Hong Liu
The famous Sidorenko's conjecture asserts that for every bipartite graph , the number of homomorphisms from to a graph with given edge density is minimized when is p…
Dirac's theorem for linear hypergraphs
Seonghyuk Im, Hyunwoo Lee
Dirac's theorem states that any -vertex graph with even integer satisfying contains a perfect matching. We generalize this to -uniform linear hypergra…
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 -vertex graph with positive edge density contains a `rich' vertex subset of size su…