At both ends of the spectrum: Chromatic bounds for the largest eigenvalue of the hypergraph normalized Laplacian
- đ¤ Speaker: Lies Beers (Vrije Universiteit Amsterdam)
- đ Date & Time: Thursday 01 August 2024, 11:25 - 11:50
- đ Venue: External
Abstract
We introduce the normalized Laplacian for graphs and a generalization to hypergraphs. We give some properties of its spectrum and provide a bound relating the smallest and largest eigenvalue to the chromatic number. We study this bound in the context of uniform unoriented hypergraphs.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- dh539
- External
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Lies Beers (Vrije Universiteit Amsterdam)
Thursday 01 August 2024, 11:25-11:50