COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
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 LaplacianAdd to your list(s) Download to your calendar using vCal
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:
Note that ex-directory lists are not shown. |
Other listsTalking to Tyrants Book Launch Said Reza Huseini Summer Hebrew UlpanOther talksTBA Lunch at The Alan Turing Institute Synchronous quantum games Mining higher-order triadic interactions Introduction by Chris Breward & Camp Rules |