Hong Liu

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+	Bivariate fluctuations for the number of arithmetic progressions in random sets	2019	Yacine Barhoumi-Andréani Christoph Koch Hong Liu
+	The typical structure of intersecting families of discrete structures	2014	József Balogh Shagnik Das Michelle Delcourt Hong Liu Maryam Sharifzadeh
+	The a new method for sum of equal powers	2000	Hong Liu

Common Coauthors

Coauthor	Papers Together
Michelle Delcourt	1
Maryam Sharifzadeh	1
Yacine Barhoumi-Andréani	1
Christoph Koch	1
Shagnik Das	1
József Balogh	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Independent sets in hypergraphs	2014	József Balogh Robert Morris Wojciech Samotij	2
+ PDF Chat	A transition of limiting distributions of large matchings in random graphs	2015	Pu Gao Cristiane M. Sato	1
+ PDF Chat	The infamous upper tail	2002	Svante Janson Andrzej Ruciński	1
+ PDF Chat	Counting sum-free sets in abelian groups	2013	Noga Alon József Balogh Robert Morris Wojciech Samotij	1
+ PDF Chat	When are small subgraphs of a random graph normally distributed?	1988	Andrzej Ruciński	1
+ PDF Chat	The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers	2013	Yoshiharu Kohayakawa Sang June Lee Vojtěch Rödl Wojciech Samotij	1
+	The exact bound in the Erdös-Ko-Rado theorem	1984	Richard M. Wilson	1
+	Stability for t-intersecting families of permutations	2010	David Ellis	1
+ PDF Chat	Two Moments Suffice for Poisson Approximations: The Chen-Stein Method	1989	Richard Arratia Larry Goldstein Louis Gordon	1
+	An Extremal Problem for two Families of Sets	1982	Péter Frankl	1
+ PDF Chat	Upper tails for subgraph counts in random graphs	2004	Svante Janson Krzysztof Oleszkiewicz Andrzej Ruciński	1
+ PDF Chat	On Dedekind’s problem: The number of monotone Boolean functions	1969	Daniel J. Kleitman	1
+	On the Shannon capacity of a graph	1979	László Lovász	1
+	The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets	1996	Rudolf Ahlswede Levon H. Khachatrian	1
+ PDF Chat	Intersecting families of permutations	2003	Peter J‎. Cameron Cheng Yeaw Ku	1
+ PDF Chat	The primes contain arbitrarily long arithmetic progressions	2008	Benjamin Green Terence Tao	1
+ PDF Chat	A Hilton-Milner Theorem for Vector Spaces	2010	A. Blokhuis A. E. Brouwer A. Roy Chowdhury Péter Frankl T. Mussche Balázs Patkós Tamás Szőnyi	1
+	Setwise intersecting families of permutations	2012	David Ellis	1
+ PDF Chat	Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations	2018	Ronen Eldan	1
+	Nonlinear large deviations	2016	Sourav Chatterjee Amir Dembo	1
+	On Erdős–Ko–Rado for random hypergraphs I	2019	Andreas Hamm J. Kahn	1
+ PDF Chat	Jigsaw percolation on random hypergraphs	2017	Béla Bollobás Oliver Cooley Mihyun Kang Christof Koch	1
+ PDF Chat	Combinatorial theorems in sparse random sets	2016	David Conlon W. T. Gowers	1
+ PDF Chat	An introduction to large deviations for random graphs	2016	Sourav Chatterjee	1
+ PDF Chat	Hypergraph containers	2015	David Saxton Andrew Thomason	1
+ PDF Chat	Extremal results for random discrete structures	2016	Mathias Schacht	1
+ PDF Chat	On sets of integers containing k elements in arithmetic progression	1975	Endre Szemerédi	1
+	On random simplices in product distributions	1980	Hiroshi Maehara	1