Abstract

Expander graphs in general, and Ramanujan graphs in particular, have been of great interest in the last three decades with many applications in computer science, combinatorics and even pure mathematics. In these notes we describe various efforts made in recent years to generalize these notions from graphs to higher dimensional simplicial complexes.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call