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

DOI10.1016/J.ENDM.2015.06.014zbMATH Open1346.05239OpenAlexW830722185WikidataQ114183688 ScholiaQ114183688MaRDI QIDQ322196FDOQ322196

Authors: Anna A. Taranenko 

Publication date: 14 October 2016

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

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

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)

Cites Work

• An upper bound on the number of Steiner triple systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Upper bounds on the permanent of multidimensional \((0,1)\)-matrices

Cited In (7)

• Title not available (Why is that?)
• A range of the multidimensional permanent on (0, 1)-matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the numbers of 1-factors and 1-factorizations of hypergraphs
• Permanents of multidimensional matrices: properties and applications

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)