On perfect matchings, edge-colourings and eigenvalues of cubic graphs
We discuss the question whether the existence of perfect matchings in a cubic graph can be seen from the spectrum of its adjacency matrix. For regular graphs in general and for three edge-disjoint perfect matchings in a cubic graph (that is, an edge colouring with three colors) the answer is known to be negative. In the latter case, a...