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

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

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

My conjectures in spectral graph theory

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

If you have a question about this talk, please contact Dr. Jan Kurkofka.

Spectral graph theory uses the eigenvalues and eigenvectors of matrices that represent graphs, for example to bound NP-complete graph parameters. I will review generic applications of spectral graph theory and then discuss four of my conjectures that have been proved (by others). I will then discuss four of my conjectures that are unproven, and indicate potential ways forward for each of them.

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.

Other lists

dddd Optimisation and Numerical Analysis Seminars Algebra seminar

Other talks

Hunt for an Earth-twin Quantum Sensing in Space Horizontal Mean Curvature Flow and stochastic optimal controls Wave turbulence in the Schrödinger-Helmholtz equation Control variates for computing transport coefficients TBA
 

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