The Lusternik-Schnirelmann theorem for graphs

Frank Josellis, Oliver Knill

We prove the discrete Lusternik-Schnirelmann theorem telling that tcat(G) less or equal to crit(G) for a general simple graph G=(V,E). It relates the minimal number tcat(G) of in G…