Constructive Ramsey Numbers
Intersection Thms with Geometric Consequences. Frankl and Wilson. 1981. R(k)
Rep bool Fns as pols mod composite numbers. Barrington-Beigel-Rudich. 1993. Useful
A Note on Const Lower bounds for the Ramsey Number R(3,t). Chung, Cleve, Dagum. 1993
The Shannon Capacit of a Union. Alon. 1998. FW
Superpoly size set-systems with rest.intersections mod 6 and explicity Ramsey graphs. Grolmusz. 2000. R(k). FW
Ext. and Psuedorandom Generators. Trevisan. 2001. Useful?
Const lower bounds for off-diagonal Ramsey numbers. Alon-Pudlak. 2001. R(s,t)
Constructing set-systems with prescribed intersection sizes. Grolmusz. 2002. FW
Pseudorandom set and explicity consts of Ramsey graphs. Pudlak and Rodl. 2004. Bipartite
2-source dispersers, sub-poly ent., and Ramsey graphs beating the FW const. Barak, Rao, Shaltiel, Wigderson. 2006. Bipartite
On explicit Ramsey graphs and estimates of the numb. of sums and products. Pudlak. 2006. Bipartite
Some constructive bounds on Ramsey numbers. Kostochka, Pudlak, Rodl. 2010. R(4,m), R(5,m), R(6,m)
More const lower bds on classical Ramsey Numbers. Xu, Shao, Radziszowski 2011. Concrete
Const Ramsey graphs from Boolean function representation. Gopalan. 2014. Shows FW optimal
Explicit two-source extractors and resilient functions.Chattopadhyay and Zuckerman. 2015. Bipartite
Two-Source Dispersers for Polylog Entropy and Improved Ramsey Graphs. Cohen. 2016. Bipartite
Improved Non-Malleable Ext., Non-Malleable Codes and Ind. Source Ext. Li. 2016. R(k)-Better than FW!
Non-Malleable Ext. and Non-Malleable Codes: Partially Opt Const. Li. 2018. Imprives Li-2006
Two Source Ext. for Asy Opt Entroy, and (Many) More. Li. 2023. R(k).Improves Li-2018?