Younjin Kim

activity

20112023

most citedDynamic coloring of graphs having no

K_{5}

minor

15 citations · 24 across the 16 of their papers we have counts for

collaborators

17 papers

math.CO2023

On Ideal Secret-Sharing Schemes for $k$ -homogeneous access structures

Younjin Kim, Jihye Kwon, Hyang-Sook Lee

A $k$ -uniform hypergraph is a hypergraph where each $k$ -hyperedge has exactly $k$ vertices. A $k$ -homogeneous access structure is represented by a $k$ -uniform hypergraph $\mathcal{…

math.CO2023

The Erdős distinct subset sums problem in a modular setting

Stijn Cambie, Jun Gao, Younjin Kim +1

We prove the following variant of the Erdős distinct subset sums problem. Given $t \geq 0$ and sufficiently large $n$ , every $n$ -element set $A$ whose subset sums are distinct modul…

math.CO2022

Crux, space constraints and subdivisions

Seonghyuk Im, Jaehoon Kim, Younjin Kim +1

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…

math.CO2021

Large complete minors in expanding graphs

Younjin Kim

In 2009, Krivelevich and Sudakov studied the existence of large complete minors in $(t, α)$ -expanding graphs whenever the expansion factor $t$ becomes super-constant. In this paper,…

math.CO2021★ 1 cited

Linear Secret-Sharing Schemes for $k$ -uniform access structures

Younjin Kim, Jihye Kwon, Hyang-Sook Lee

A {\it $k$ -uniform hypergraph} $H = (V, E)$ consists of a set $V$ of vertices and a set $E$ of hyperedges ( $k$ -hyperedges), which is a family of $k$ -subsets of $V$ . A {\it…

math.CO2021

Nested cycles with no geometric crossings

Irene Gil Fernández, Jaehoon Kim, Younjin Kim +1

In 1975, Erdős asked the following question: what is the smallest function $f (n)$ for which all graphs with $n$ vertices and $f (n)$ edges contain two edge-disjoint cycles $C_{1}$ and…

On Ideal Secret-Sharing Schemes for k-homogeneous access structures