Gašper Fijavž: Minimal graphs containing k perfect matchings

Povzetek. A finite undirected graph is minimally k-matchable, if it has at least k perfect matchings but deleting any edge results in a graph which has not. We prove that, given k, there exists a finite set of graphs Sigma_k, so that every minimally k-matchable graph is an odd subdivision of a graph from Sigma_k.