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
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2014.11.001 / rank
Normal rank
 
Property / author
 
Property / author: Mehdi Aaghabali / rank
Normal rank
 
Property / author
 
Property / author: Saieed Akbari / rank
Normal rank
 
Property / author
 
Property / author: Shmuel Friedland / rank
Normal rank
 
Property / author
 
Property / author: Klas Markström / rank
Normal rank
 
Property / author
 
Property / author: Mehdi Aaghabali / rank
 
Normal rank
Property / author
 
Property / author: Saieed Akbari / rank
 
Normal rank
Property / author
 
Property / author: Shmuel Friedland / rank
 
Normal rank
Property / author
 
Property / author: Klas Markström / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2592261830 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1310.5634 / 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: 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
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2014.11.001 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:49, 9 December 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

    Identifiers