Graph distinguishing numbers constitute a vital parameter in understanding the symmetry properties of graphs. Fundamentally, the distinguishing number of a graph is the minimal number of labels ...
It is not known whether or not the stable rational cohomology groups H̃* (Aut(F∞); ℚ) always vanish (see Hatcher in [5] and Hatcher and Vogtmann in [7] where they pose the question and show that it ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback