University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > At both ends of the spectrum: Chromatic bounds for the largest eigenvalue of the hypergraph normalized Laplacian

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

  • UserLies Beers (Vrije Universiteit Amsterdam)
  • ClockThursday 01 August 2024, 11:25-11:50
  • HouseExternal.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity