Spectral graph and hypergraph theory: connections and applications
December 6 to December 10, 2021
American Institute of Mathematics,
San Jose, California
and Nikhil Srivastava
This workshop will be devoted to spectral
graph theory and its extensions to digraphs and hypergraphs. Graph
theory is the mathematics of networks. A graph can be described entirely
by various matrices, which provides a natural tie between linear algebra
and discrete mathematics. The linear algebraic properties of these
matrices have surprising connections to the combinatorial properties of
the graph; these connections form the basis of spectral graph theory.
In recent years, these notions have been extended and used with great
success for signed graphs, directed graphs, hypergraphs and simplicial
complexes. During this workshop, we will concentrate on the following
- Spectral problems on graphs and signed graphs.
- Adjacency matrices of directed and oriented graphs.
- Spectral bounds on hypergraphs and simplicial complexes.
Material from the workshop
A list of participants.
A report on the workshop activities.
A list of open problems.