209 citations · 425 across the 17 of their papers we have counts for
18 papers
Threshold functions for incidence properties in finite vector spaces
Jeong Han Kim, Ben Lund, Thang Pham +1
The main purpose of this paper is to provide threshold functions for the events that a random subset of the points of a finite vector space has certain properties related to point-…
Sidorenko's conjecture for higher tree decompositions
David Conlon, Jeong Han Kim, Choongbum Lee +1
This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for str…
Some advances on Sidorenko's conjecture
David Conlon, Jeong Han Kim, Choongbum Lee +1
A bipartite graph is said to have Sidorenko's property if the probability that the uniform random mapping from to the vertex set of any graph is a homomorphism is at…
On the total variation distance between the binomial random graph and the random intersection graph
Jeong Han Kim, Sang June Lee, Joohan Na
When each vertex is assigned a set, the intersection graph generated by the sets is the graph in which two distinct vertices are joined by an edge if and only if their assigned set…
On Coupon Colorings of Graphs
Bob Chen, Jeong Han Kim, Michael Tait +1
Let be a graph with no isolated vertices. A {\em -coupon coloring} of is an assignment of colors from to the vertices of such that the neigh…
Universality of random graphs for graphs of maximum degree two
Jeong Han Kim, Sang June Lee
For a family of graphs, a graph is called \emph{-universal} if contains every graph in as a subgraph. Let be the…