Younjin Kim

According to our database1, Younjin Kim authored at least 19 papers between 2011 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Crux, space constraints and subdivisions.
J. Comb. Theory B, 2025

2023
On Ideal Secret-Sharing Schemes for k-homogeneous access structures.
CoRR, 2023

2022
Hypergraph Based Berge Hypergraphs.
Graphs Comb., 2022

The Number of $k$-Dimensional Corner-Free Subsets of Grids.
Electron. J. Comb., 2022

2020
An Erdős-Ko-Rado Type Theorem via the Polynomial Method.
Symmetry, 2020

Tree decompositions of graphs without large bipartite holes.
Random Struct. Algorithms, 2020

600-GHz Wave Generator Consisting of Arrayed Light Sources in Combination with Arrayed Photomixers.
Proceedings of the European Conference on Optical Communications, 2020

2019
Two Conjectures in Ramsey-Turán Theory.
SIAM J. Discret. Math., 2019

2017
Sparse Spanning k-Connected Subgraphs in Tournaments.
SIAM J. Discret. Math., 2017

On the Number of r-Matchings in a Tree.
Electron. J. Comb., 2017

2016
Dynamic coloring of graphs having no K<sub>5</sub> minor.
Discret. Appl. Math., 2016

2015
On the Erdős-Ko-Rado theorem and the Bollobás theorem for t-intersecting families.
Eur. J. Comb., 2015

A proof of Alon-Babai-Suzuki's conjecture and multilinear polynomials.
Eur. J. Comb., 2015

Identifying codes and searching with balls in graphs.
Discret. Appl. Math., 2015

2013
Cycle-Saturated Graphs with Minimum Number of Edges.
J. Graph Theory, 2013

The structure of the typical graphs of given diameter.
Discret. Math., 2013

2012
Large B<sub>d</sub>-Free and Union-free Subfamilies.
SIAM J. Discret. Math., 2012

2011
Minimum Ck-saturated graphs.
Electron. Notes Discret. Math., 2011

Large Bd-free and union-free subfamilies.
Electron. Notes Discret. Math., 2011


  Loading...