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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

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

Download to your calendar using vCal

  • UserLies Beers (Vrije Universiteit Amsterdam)
  • ClockThursday 15 August 2024, 11:00-12:00
  • HouseExternal.

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

HTA - Hypergraphs: Theory and Applications

For a graph with largest normalized Laplacian eigenvalue lambda and (vertex) coloring number chi, lambda is known to be larger than or equal to chi/(chi-1). We consider properties of graphs for which this bound is sharp, and we study the multiplicity of chi/(chi-1). We also look at the spectrum of the 1-sum (a graph operation) of two graphs, with a focus on the maximal eigenvalue. We consider a generalization of the bound for hypergraphs and consider uniform hypergraphs for which this bound is sharp. Finally, we study a hypergraph operation and its relation to the hypergraph bound.

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 lists

Large Lecture Theatre, Department of Zoology , Downing Street, CB2 3EJ Creating research impact through commercialisation Average on Saturdays: 7576.3974359 kWh

Other talks

The Neurophenomenology of Surrender: Agency, Renewal, and Social Engagement in Speaking in Tongues Polar Oceans Seminar Talk Coming soon Synthesizing Diverse Policies for Multi-Agent Coordination Title to be confirmed Coexisting with carnivores? The lynx and wolf reintroduction debate
 

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