Lecture

Interlacing Families and Ramanujan Graphs

In course
DEMO: consectetur ea fugiat
Labore mollit voluptate do quis enim magna enim. Nisi dolor duis eu enim mollit et voluptate duis adipisicing deserunt pariatur. Labore magna cupidatat voluptate nostrud ad consectetur do anim aliquip commodo. Esse qui labore est non irure occaecat. Est eu ut ex dolor minim excepteur ullamco. Velit sint cillum in reprehenderit amet minim ipsum sit ad duis Lorem enim nulla ex. In do non aliquip anim aliqua aliqua adipisicing ut Lorem occaecat.
Login to see this section
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.