At both ends of the spectrum: Chromatic bounds for the largest eigenvalue of the hypergraph normalized Laplacian

Add to your list(s) Download to your calendar using vCal

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

If you have a question about this talk, please contact nobody.

HTA - Hypergraphs: Theory and Applications

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.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• External
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.