Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges

DOI10.1016/j.ejc.2014.11.001zbMath1304.05108arXiv1310.5634OpenAlexW2592261830MaRDI QIDQ482134

Z. Tajfirouz, Shmuel Friedland, Saieed Akbari, Mehdi Aaghabali, Klas Markström

Publication date: 19 December 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.5634

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

On the number of Sudoku squares

Cites Work

• Unnamed Item
• The maximum number of perfect matchings in graphs with a given degree sequence
• On the number of matchings in regular graphs
• A lower bound for the permanent of a doubly stochastic matrix
• Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices

This page was built for publication: Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges