Lecture

Matching Polynomials: Real-Rooted Property

In course

Tempor ea sit irure non eiusmod tempor velit est consectetur. Aliqua do consectetur ea incididunt occaecat irure sint incididunt pariatur consequat cillum cillum et ullamco. Dolore non quis adipisicing proident non qui voluptate sunt excepteur est culpa dolore excepteur eiusmod. Occaecat sit ad occaecat anim in aliquip ullamco deserunt aliquip. Do nostrud dolor laboris anim duis fugiat qui proident excepteur id culpa.

Description

This lecture covers the concept of matching polynomials, focusing on their real-rooted property and related bounds. The instructor explains how to determine the maximum degree of matching polynomials and provides a proof using Ramanujan bounds. The lecture also discusses random facts about matching polynomials always being real-rooted.

Official source

https://mediaspace.epfl.ch/media/0_9xvfyw1x

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.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related lectures (33)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.