Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-19T01:37:18.193Z Has data issue: false hasContentIssue false

Dismantlability Revisited for Ordered Sets and Graphs and the Fixed-Clique Property

Published online by Cambridge University Press:  20 November 2018

John Ginsburg*
Affiliation:
Department of Mathematics, University of Winnipeg Winnipeg, Manitoba R3B 2E9
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We give a unified treatment of several fixed-point type theorems by using the concept of dismantlability, extended from ordered sets to arbitrary graphs. For a graph G and a vertex x of G we let NG(X) denote the set of neighbours of x in G. We say that x is a subdominant vertex of G if there is a vertex y of G, distinct from x, such that NG(x)∪{x} ⊆ NG(y)∪{y}. If G has n vertices we say that G is dismantlable if the vertices of G can be listed as x1, x2, ..., xi,..., xn such that, for all i = 1,2,..., n— 1, xi is a subdominant vertex of the graph Gi = G — {xj : j < i}

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1994