Lunches‎ > ‎

DOT: Dependent Random Choice

posted Oct 17, 2014, 10:12 AM by Dirk Oliver Theis
Last Monday, Oct 13, DOT started a series of lunches in which he plans to make everybody familiar with the dependent random choice technique.  He started with the Alon-Krivelevich-Sudakov bound for the Turan number of bipartite graphs.
Comments