H-series - Document - PDFSEARCH.IO - Document Search Engine

First Page	Meta Content
	EXPONENTIALLY MANY PERFECT MATCHINGS IN CUBIC GRAPHS L. ESPERET, F. KARDOŠ, A. D. KING, D. KRÁL’, AND S. NORINE Abstract. We show that every cubic bridgeless graph G has at least 2\|V (G)\|/3656 perfect matchings. This Add to Reading List Document Date: 2016-02-04 05:53:38 Open Document File Size: 304,88 KB Share Result on Facebook

UPDATE

EXPONENTIALLY MANY PERFECT MATCHINGS IN CUBIC GRAPHS L. ESPERET, F. KARDOŠ, A. D. KING, D. KRÁL’, AND S. NORINE Abstract. We show that every cubic bridgeless graph G has at least 2|V (G)|/3656 perfect matchings. ThisAdd to Reading List