Counting independent sets in cubic graphs of given girth (Q1791708): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q129188170, #quickstatements; #temporary_batch_1724922362815
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1611.01474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Widom–Rowlinson Occupancy Fraction in Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of complete subgraphs in a graph with given maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of independent sets in triangle-free regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets, matchings, and occupancy fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average size of independent sets in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremes of the internal energy of the Potts model on cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weighted graph homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence in graphs with maximum degree four / 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: Some Ramsey-Type Numbers and the Independence Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cages—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Independent Sets in a Regular Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Regular Graphs: Independent Sets and Graph Homomorphisms / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129188170 / rank
 
Normal rank

Latest revision as of 10:07, 29 August 2024

scientific article
Language Label Description Also known as
English
Counting independent sets in cubic graphs of given girth
scientific article

    Statements

    Counting independent sets in cubic graphs of given girth (English)
    0 references
    0 references
    0 references
    11 October 2018
    0 references
    independent sets
    0 references
    independence polynomial
    0 references
    hard-core model
    0 references
    Petersen graph
    0 references
    Heawood graph
    0 references
    occupancy fraction
    0 references

    Identifiers