Concept

Cage (graph theory)

Related lectures (5)

Covers girth, independence, probability, union bound, sets, and hypergraph recoloring.

Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.

Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.

Explores the construction of Ramanujan graphs using polynomials and addresses challenges with the probabilistic method.

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.