Two problems on independent sets in graphs (Q641174): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2011.06.015 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2144467924 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1206.3206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The choice number of random bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The roots of the independence polynomial of a clawfree graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs for homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5343356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit distribution for the existence of Hamiltonian cycles in random bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The independent set sequence of regular bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the number of independent sets in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numbers of independent \(k\)-sets in a claw free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of monomer-dimer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp upper bound for the number of stable sets in graphs with given number of cut edges / 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: Q3429589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4852752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the number of vertex independent sets in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Independent Sets in a Regular Graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2011.06.015 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:25, 9 December 2024

scientific article
Language Label Description Also known as
English
Two problems on independent sets in graphs
scientific article

    Statements

    Two problems on independent sets in graphs (English)
    0 references
    0 references
    21 October 2011
    0 references
    independent set sequence
    0 references
    independent set polynomial
    0 references
    stable set polynomial
    0 references
    unimodal sequence
    0 references
    log concave sequence
    0 references
    random graph
    0 references

    Identifiers