On the numbers of 1-factors and 1-factorizations of hypergraphs
From MaRDI portal
Publication:507504
DOI10.1016/j.disc.2016.11.024zbMath1355.05178arXiv1503.08270OpenAlexW2297531352WikidataQ114190717 ScholiaQ114190717MaRDI QIDQ507504
Publication date: 6 February 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.08270
Related Items
An asymptotic lower bound on the number of bent functions, From one to many rainbow Hamiltonian cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect matchings in 3-partite 3-uniform hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Upper bounds on the permanent of multidimensional \((0,1)\)-matrices
- The maximum number of perfect matchings in graphs with a given degree sequence
- Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- 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
- An Upper Bound for the Permanent of a 3-Dimensional (0, 1)-Matrix
- Combinatorial Matrix Functions and 1-Factors of Graphs
