
Matching polynomials of vertex transitive graphs ★★
Author(s): Mohar
Conjecture For every integer
there exists a vertex transitive graph
whose matching polynomial has a root of multiplicity at least
.



Keywords: matching polynomial; vertex-transitive
A generalization of Vizing's Theorem? ★★
Author(s): Rosenfeld
Conjecture Let
be a simple
-uniform hypergraph, and assume that every set of
points is contained in at most
edges. Then there exists an
-edge-coloring so that any two edges which share
vertices have distinct colors.






Keywords: edge-coloring; hypergraph; Vizing