On the numbers of 1-factors and 1-factorizations of hypergraphs (Q507504): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(9 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2016.11.024 / rank
Normal rank
 
Property / author
 
Property / author: Anna A. Taranenko / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q114190717 / rank
 
Normal rank
Property / author
 
Property / author: Anna A. Taranenko / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2297531352 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1503.08270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of perfect matchings in graphs with a given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4100097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Upper Bound for the Permanent of a 3-Dimensional (0, 1)-Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the van der Waerden conjecture for permanents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Matrix Functions and 1-Factors of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the number of Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in 3-partite 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in large uniform hypergraphs with large minimum collective degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting 1-factors in regular bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the permanent of multidimensional \((0,1)\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact minimum degree thresholds for perfect matchings in uniform hypergraphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2016.11.024 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:52, 9 December 2024

scientific article
Language Label Description Also known as
English
On the numbers of 1-factors and 1-factorizations of hypergraphs
scientific article

    Statements

    On the numbers of 1-factors and 1-factorizations of hypergraphs (English)
    0 references
    6 February 2017
    0 references
    uniform hypergraph
    0 references
    1-factor
    0 references
    1-factorization
    0 references
    permanent, multidimensional matrix
    0 references
    0 references

    Identifiers