A notion of graph homeomorphism
classification
🧮 math.GN
cs.DM
keywords
fixedgraphdimensionhomeomorphismhomotopynotionpointbrouwer-lefshetz
read the original abstract
We introduce a notion of graph homeomorphisms which uses the concept of dimension and homotopy for graphs. It preserves the dimension of a subbasis, cohomology and Euler characteristic. Connectivity and homotopy look as in classical topology. The Brouwer-Lefshetz fixed point leads to the following discretiszation of the Kakutani fixed point theorem: any graph homeomorphism T with nonzero Lefschetz number has a nontrivial invariant open set which is fixed by T.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.