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

DOI10.1016/j.endm.2015.06.014zbMath1346.05239OpenAlexW830722185WikidataQ114183688 ScholiaQ114183688MaRDI QIDQ322196

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

hypergraph1-factor1-factorizationpermanentmultidimensional matrix

Mathematics Subject Classification ID

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

Related Items

Permanents of multidimensional matrices: Properties and applications, A range of the multidimensional permanent on (0, 1)-matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds on the permanent of multidimensional \((0,1)\)-matrices
• The maximum number of perfect matchings in graphs with a given degree sequence
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• Proof of the van der Waerden conjecture for permanents
• Counting 1-factors in regular bipartite graphs
• An upper bound on the number of Steiner triple systems