Sangjune Lee

Orcid: 0000-0001-9752-7033

Affiliations:
  • Kyung Hee University, Seoul, Republic of Korea
  • Duksung Women's University, Department of Mathematics, Seoul, South Korea (former)


According to our database1, Sangjune Lee authored at least 16 papers between 2011 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On zero-sum free sequences contained in random subsets of finite cyclic groups.
Discret. Appl. Math., May, 2023

2021
On strong Sidon sets of integers.
J. Comb. Theory A, 2021

Detecting and Recovering Integer Data Manipulated by Multiplication With a Nonintegral Real Number and a Rounding Operation.
IEEE Access, 2021

2020
On the independence number of non-uniform uncrowded hypergraphs.
Discret. Math., 2020

2019
AK-type stability theorems on cross t-intersecting families.
Eur. J. Comb., 2019

2018
Infinite Sidon Sets Contained in Sparse Random Sets of Integers.
SIAM J. Discret. Math., 2018

On the total variation distance between the binomial random graph and the random intersection graph.
Random Struct. Algorithms, 2018

2017
Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families.
Discret. Appl. Math., 2017

2016
The number of B<sub>3</sub>-sets of a given cardinality.
J. Comb. Theory A, 2016

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

On the Number of <i>B<sub>h</sub> </i>-Sets.
Comb. Probab. Comput., 2016

2015
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers.
Random Struct. Algorithms, 2015

2014
Universality of Random Graphs for Graphs of Maximum Degree Two.
SIAM J. Discret. Math., 2014

An Erdős-Ko-Rado theorem for cross t-intersecting families.
J. Comb. Theory A, 2014

2013
Dynamic coloring and list dynamic coloring of planar graphs.
Discret. Appl. Math., 2013

2011
The maximum size of a Sidon set contained in a sparse random set of integers.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011


  Loading...