Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (Q482134): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
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: Q4044717 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A lower bound for the permanent of a doubly stochastic matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of matchings in regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum / rank | |||
Normal rank |
Revision as of 11:03, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges |
scientific article |
Statements
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (English)
0 references
19 December 2014
0 references