University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Conjectures in spectral graph theory

Conjectures in spectral graph theory

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

  • UserClive Elphick (University of Birmingham)
  • ClockTuesday 26 September 2017, 15:00-16:00
  • HouseWatson LTA.

If you have a question about this talk, please contact Dr Andrew Treglown.

I will discuss six of my conjectures in spectral graph theory, two of which have been proved (by others) to date. All of the conjectures involve eigenvalues of the adjacency matrix of a graph, and several are bounds for the clique or chromatic number. This is joint work, principally with Pawel Wocjan.

This talk is part of the Combinatorics and Probability seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.