Dismantlability of weakly systolic complexes and applications
The fixed point theorem is proved by using a graph-theoretical tool -- dismantlability. In particular we show that 1-skeleta of weakly systolic complexes, i.e., weakly bridged graphs, are dismantlable. On the way we show numerous characterizations of weakly bridged graphs and weakly systolic complex...
Saved in:
Published in: | Transactions of the American Mathematical Society Vol. 367; no. 2; pp. 1247 - 1272 |
---|---|
Main Authors: | , |
Format: | Journal Article |
Language: | English |
Published: |
American Mathematical Society
01-02-2015
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The fixed point theorem is proved by using a graph-theoretical tool -- dismantlability. In particular we show that 1-skeleta of weakly systolic complexes, i.e., weakly bridged graphs, are dismantlable. On the way we show numerous characterizations of weakly bridged graphs and weakly systolic complexes.]]> |
---|---|
ISSN: | 0002-9947 1088-6850 |
DOI: | 10.1090/S0002-9947-2014-06137-0 |