Article
Licensed
Unlicensed
Requires Authentication
On the number of independent sets in graphs with fixed independence number
-
A. B. Daynyak
Published/Copyright:
June 28, 2007
We construct a sequence of graphs of large degree with growing number of vertices for which the number of independent sets is substantially greater than the number of all subsets of the independent set of maximal cardinality.
Published Online: 2007-06-28
Published in Print: 2007-07-20
Copyright 2007, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- The compound Poisson distribution of the number of matches of values of a discrete function of s-tuples in segments of a sequence of random variables
- On stability of an efficient solution of a vector Boolean problem of maximisation of absolute values of linear functions
- Optimal logarithmic functions for lifting of a solution of an exponential congruence
- On the number of independent sets in graphs with fixed independence number
- Homomorphisms and endomorphisms of linear and alinear quasigroups
- On finite groups close to completely factorisable groups
- Non-asymptotic bounds for probabilities of the rank of a random matrix over a finite field
- On representation of k-valued logic functions by a sum of products of subfunctions
- A lower bound for the 4-satisfiability threshold
- A Markov chain of order s with r partial connections and statistical inference on its parameters
Articles in the same Issue
- The compound Poisson distribution of the number of matches of values of a discrete function of s-tuples in segments of a sequence of random variables
- On stability of an efficient solution of a vector Boolean problem of maximisation of absolute values of linear functions
- Optimal logarithmic functions for lifting of a solution of an exponential congruence
- On the number of independent sets in graphs with fixed independence number
- Homomorphisms and endomorphisms of linear and alinear quasigroups
- On finite groups close to completely factorisable groups
- Non-asymptotic bounds for probabilities of the rank of a random matrix over a finite field
- On representation of k-valued logic functions by a sum of products of subfunctions
- A lower bound for the 4-satisfiability threshold
- A Markov chain of order s with r partial connections and statistical inference on its parameters