Stable graphs for a family of endomorphisms

DOI10.1016/0012-365X(95)00197-5zbMath0859.05073OpenAlexW1963669909MaRDI QIDQ1916121

Norbert Polat

Publication date: 2 July 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00197-5

zbMATH Keywords

commuting endomorphismsfixed point theoremspathcommuting contractionsrayless graphfixed subgraphinvariant subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (1)

Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. II: Fixed subgraph properties and infinite treelike partial cubes

Cites Work

• Unnamed Item
• Unnamed Item
• Ein Ordnungsbegriff für Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenhaengende Graphen
• Fixed-point theorems for compact convex sets
• Invariant Hamming graphs in infinite quasi-median graphs
• Finite invariant simplices in infinite graphs
• Finite invariant sets in infinite graphs
• A Helly theorem for geodesic convexity in strongly dismantlable graphs
• Automorphisms and endomorphisms of infinite locally finite graphs
• A lattice-theoretical fixpoint theorem and its applications
• Fixed-edge theorem for graphs with loops
• Retract‐collapsible graphs and invariant subgraph properties

This page was built for publication: Stable graphs for a family of endomorphisms