Fixed simplex property for retractable complexes

DOI10.1155/2010/303640MaRDI QIDQ610891zbMATH OpenOpenAlexWikidataFDO

Authors Adam Idzik, Anna Zapart

Publication date 13 December 2010

Published in Fixed Point Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/231042

zbMATH Keywords

dunce capfixed clique property.fixed pointgraphlooprecursively contractible complexSimplexstartree

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Fixed-point theorems (47H10) Polytopes and polyhedra (52B99) Retraction (54C15) Fixed-point and coincidence theorems (topological aspects) (54H25) PL-topology (57Q99)

Review text

The following are the main results of the paper: I) A star has the fixed point property; II) If an \(\leq n\)-complex is retractable, then it has the fixed point property; III) From an \(s\)-recursively retractable complex \(K_{\leq n}\), by a sequence of retractions, one can obtain the complex generated by any simplex \(S\in K_{\leq n}\). Some applications to graph theory of the obtained results are then given.

Recommendations

• On retractable sets and the fixed point property
• Local properties of simplicial complexes
• Fixed points and \(\varepsilon\)-retracts
• Retraction of simplicial complexes
• Fixed point property for 11-element sets

Cites work

• A fixed-point theorem for trees
• Fixed-edge theorem for graphs with loops
• The Kakutani property and the fixed point property of topological spaces with abstract convexity

Cited in

(3)

• Local properties of simplicial complexes
• Retract‐collapsible graphs and invariant subgraph properties
• Retraction of simplicial complexes

This page was built for publication: Fixed simplex property for retractable complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q610891)