Lecture

Interlacing Families and Ramanujan Graphs

Description

This lecture covers the concept of interlacing families and 1-sided Ramanujan graphs. The instructor discusses characteristic polynomials and matching polynomials in trees and graphs. The lecture explores the properties of signed adjacency matrices and the probabilistic method for constructing Ramanujan graphs. It also delves into the existence of 1-sided Ramanujan graphs and the proof of their existence. Additionally, the lecture touches upon the unsolved problem of 2-sided Ramanujan graphs. The instructor presents examples and explains the significance of these concepts in graph theory.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.