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, ...

In math, as in life, small choices can have big consequences. This is especially true in graph theory, a field that studies networks of objects and the connections between them. Here’s a little puzzle ...