Counting independent sets in graphs (Q2346574): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2015.02.005 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1412.0940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in regular graphs and sum-free subsets of finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refinement of the Cameron-Erdős conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting sum-free sets in abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit construction of linear sized tolerant networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds for some multicolour Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of \(K_{m,m}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of <i>K</i> <sub> <i>s,t</i> </sub> -free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs that do not Contain a Thomsen Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial theorems relative to a random set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial theorems in sparse random sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of \(B_3\)-sets of a given cardinality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE CAMERON–ERDOS CONJECTURE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting sumsets and sum-free sets modulo a prime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-free sets in abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / 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: The Asymptotic Number of Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic progressions of length three in subsets of a random set / rank
 
Normal rank
Property / cites work
 
Property / cites work: K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-free sets in Abelian groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of \(C_{2\ell}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Sets of Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability results for random discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics of the number of sum-free sets in abelian groups of even order. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph containers / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Colourings of Regular Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal results for random discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets of integers containing k elements in arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Sets of Positive Density / 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.EJC.2015.02.005 / rank
 
Normal rank

Latest revision as of 02:57, 18 December 2024

scientific article
Language Label Description Also known as
English
Counting independent sets in graphs
scientific article

    Statements

    Counting independent sets in graphs (English)
    0 references
    0 references
    2 June 2015
    0 references
    Roth's theorem
    0 references
    sparse random sets of integers
    0 references
    enumerating method
    0 references
    0 references
    0 references
    0 references

    Identifiers