One of the highlights in the Robertson-Seymour theory on graph minors is the finiteness (for each fixed surface S) of the set of the minimal forbidden minors for S. Theorem 7.0.1 (Robertson and ...
We consider a special version of random sequential adsorption (RSA) with nearest-neighbor interaction on infinite tree graphs. In classical RSA, starting with a graph with initially inactive nodes, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback