We consider the number of vertex independent sets i(G). In general, the problem of determining the value of i(G) is NP-complete. We present several upper and lower bounds for i(G) in terms of order, ...
Mathematicians have proved that copies of smaller graphs can always be used to perfectly cover larger ones. On January 8, three mathematicians posted a proof of a nearly 60-year-old problem in ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results