Laplacian Eigenvalues and multisections

We will describe how simple computations on the eigenvalues of the laplacian matrix of a graph and a certain Gram matrix provide bounds on the number of edges joining parts in a graph where the vertex set is separated in parts of given sizes. These bounds are compared to existing ones.