A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs (Q3466354): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710423558064
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2141505149 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1308.3242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in graphs with given minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems for independent set enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two problems on independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing <i>H</i>‐Colorings of a Regular Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Acquaintances and Strangers at any Party / 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: Entropy, independent sets and antichains: A new approach to Dedekind’s problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hilbert series of the face ring of a flag complex / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical expansion in mathematics / 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 10:24, 11 July 2024

scientific article
Language Label Description Also known as
English
A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs
scientific article

    Statements

    A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs (English)
    0 references
    0 references
    0 references
    0 references
    1 February 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    independent sets
    0 references
    minimum degree
    0 references
    cliques
    0 references
    subgraph enumeration
    0 references
    extremal graph theory
    0 references
    regular graphs
    0 references
    Moore graphs
    0 references
    0 references
    0 references