Graphs with the fewest matchings (Q524194): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Lauren Keough / rank
Normal rank
 
Property / author
 
Property / author: Andrew John Radcliffe / rank
Normal rank
 
Property / author
 
Property / author: Lauren Keough / rank
 
Normal rank
Property / author
 
Property / author: Andrew John Radcliffe / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2183602968 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1310.1879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with maximal number of adjacent pairs of edges / 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: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy bounds for perfect matchings and Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An entropy proof of the Kahn-Lovász theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs for homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with the maximum or minimum number of 1-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Entropy Approach to the Hard-Core Model on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3243274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Independent Sets in a Regular Graph / rank
 
Normal rank

Latest revision as of 17:07, 13 July 2024

scientific article
Language Label Description Also known as
English
Graphs with the fewest matchings
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references