Upper bound for the number of spanning forests of regular graphs (Q2700981): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3162973312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluations of Tutte polynomials of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of forests and connected spanning subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential growth constants for spanning forests on Archimedean lattices: Values and comparisons of upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Polynomials and Their Applications I: The Tutte Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative association in uniform forests and connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of monomer-dimer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the Jones and Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minors in lifts of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of negative dependence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees and orientation of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Contribution to the Theory of Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704790 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:26, 1 August 2024

scientific article
Language Label Description Also known as
English
Upper bound for the number of spanning forests of regular graphs
scientific article

    Statements

    Upper bound for the number of spanning forests of regular graphs (English)
    0 references
    0 references
    0 references
    27 April 2023
    0 references
    Laplacian matrices
    0 references
    matching polynomial
    0 references

    Identifiers

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