ResearchWorks Archive

# Browsing Mathematics by Author "Solomyak, Margarita"

Sort by: Order: Results:

• (1997)
Let $\Gamma$ be a Cayley graph of a finitely generated group G. Subgraphs which contain all vertices of $\Gamma ,$ have no cycles, and no finite connected components are called essential spanning forests. The set \${\cal ...