✦ LIBER ✦

Mutation classes of diagrams via infinite graphs

✍ Scribed by Thilo Henrich

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 260 KB
Volume: 284
Category: Article
ISSN: 0025-584X
DOI: 10.1002/mana.200910224

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We give a complete description of the cluster‐mutation classes of diagrams of Dynkin types \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbb {A},\mathbb {B},\mathbb {D}$\end{document} and of affine Dynkin types \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbb {B}^{(1)},\mathbb {C}^{(1)},\mathbb {D}^{(1)}$\end{document} via certain families of diagrams.

📜 SIMILAR VOLUMES

Large classes of infinite k-cop-win grap

Large classes of infinite k-cop-win graphs

✍ Anthony Bonato; Geňa Hahn; Claude Tardif 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB 👁 1 views

While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exist, we provide as large as possible classes of infinite graphs with finite cop number. More precisely, for each infinite car

An infinite class of reach-preservable g

An infinite class of reach-preservable graphs

✍ Gagliardi, Daniel; Lewinter, Marty 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 42 KB 👁 1 views

for all w in G. G is called reach-preservable if each of its spanning trees contains at least one reachpreserving vertex. We show that K 2,n is reach-preservable. We show that a graph is bipartite if and only if given any pair of vertices, there exists a spanning tree in which both vertices a reach-