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 this paper, we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback