EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2288. Spectral bounds for set avoiding graphs via polynomial optimization
Invited abstract in session MC-38: Applications of polynomial optimization, stream Conic Optimization: Theory, Algorithms, and Applications.
Monday, 12:30-14:00Room: 34 (building: 306)
Authors (first author is the speaker)
| 1. | Tobias Metzlaff
|
Abstract
The chromatic number of a set avoiding graph has a lower spectral bound, which is often sharp.
We assume that the vertices and the avoided set are invariant under a crystallographic reflection group.
Then the spectral bound can be expressed as the minimum of a polynomial on a basic semi-algebraic set.
We compute several bounds for interesting graphs analytically and numerically.
Based on joint work with Evelyne Hubert, Philippe Moustrou and Cordian Riener.
Keywords
- Mathematical Programming
- Programming, Semidefinite
- Graphs and Networks
Status: accepted
Back to the list of papers