Printable PDF
Department of Mathematics,
University of California San Diego

****************************

Final Defense

Alex Eustis

UCSD

Hypergraph Independence Numbers

Abstract:

We discuss the general problem of finding a large independent set in a hypergraph, using ordinary and probabilistic combinatorics, and summarize my research on the subject (joint with Jacques Verstraete).

March 6, 2013

2:00 PM

AP&M 5829

****************************