Determination of (0,2)-regular sets in graphs and applications

In this paper, relevant results about the determination of (k,t)-regular sets, using the main eigenvalues of a graph, are reviewed and some results about the determination of (0,2)-regular sets are introduced. An algorithm for that purpose is also described. As an illustration, this algorithm is applied to the determination of maximum matchings in arbitrary graphs

Graph Theory

Highlights of this workshop on structural graph theory included new developments on graph and matroid minors, continuous structures arising as limits of finite graphs, and new approaches to higher graph connectivity via tree structures