Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs

DOI10.1016/J.ENDM.2015.06.014MaRDI QIDQ322196zbMATH OpenOpenAlexWikidataFDO

Authors Anna A. Taranenko

Publication date 14 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.06.014

zbMATH Keywords

hypergraphpermanent1-factorization1-factormultidimensional matrix

Mathematics Subject Classification ID

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

Recommendations

• On the numbers of 1-factors and 1-factorizations of hypergraphs
• scientific article; zbMATH DE number 7640248
• scientific article; zbMATH DE number 4012665
• On the number of 1-factorizations of a complete graph
• scientific article; zbMATH DE number 1990702

Cites work

• scientific article; zbMATH DE number 3458807 (Why is no real title available?)
• scientific article; zbMATH DE number 3520420 (Why is no real title available?)
• An upper bound on the number of Steiner triple systems
• Counting 1-factors in regular bipartite graphs
• Proof of the van der Waerden conjecture for permanents
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• The maximum number of perfect matchings in graphs with a given degree sequence
• Upper bounds on the permanent of multidimensional \((0,1)\)-matrices

Cited in

(7)

• Permanents of multidimensional matrices: properties and applications
• scientific article; zbMATH DE number 4055659 (Why is no real title available?)
• scientific article; zbMATH DE number 1990702 (Why is no real title available?)
• scientific article; zbMATH DE number 3900812 (Why is no real title available?)
• scientific article; zbMATH DE number 7640248 (Why is no real title available?)
• On the numbers of 1-factors and 1-factorizations of hypergraphs
• A range of the multidimensional permanent on (0, 1)-matrices

This page was built for publication: Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322196)