Periodic Reporting for period 1 - SREACEP (Sparse Robust Expander with Applications in Combinatorial Embedding Problems)

One of the major developments in combinatorics in the past four decades is that of expanders. It was first introduced to construct networks (represented by graphs) that are economical (sparse) and robust (highly connected). Expanders can be defined in various different ways...