AbstractA fixed-point free map f : X → X is said to be colorable with k colors if there exists a closed cover C of X consisting of k elements such that C ∩ f(C) = ∅ for every C in C. It is shown that every fixed-point free continuous selfmap of a compact space X with dim X ⩽ n can be colored with n + 3 colors. Similar results are obtained for finitely many maps. It is shown that every free Zp-actionon an n-dimensional compact space X has genus at most n + 1
AbstractFor every surface S there exists a natural number n(S) such that every map drawn on S can be...
We present a polynomial-time algorithm determining whether or not, for a fixed k, a P 5-free graph c...
We present a polynomial-time algorithm determining whether or not, for a fixed k, a P 5-free graph c...
AbstractA fixed-point free map f : X → X is said to be colorable with k colors if there exists a clo...
AbstractA fixed-point free map f: X → X is said to be colorable with k colors if there exists a clos...
AbstractA fixed-point free map f: X → X is said to be colorable with k colors if there exists a clos...
We investigate the color number and genus for fixed-point free maps of order three. A result that ha...
We investigate the color number and genus for fixed-point free maps of order three. A result that ha...
AbstractWe present a simpler proof of the known theorem that a fixed-point free homeomorphism on an ...
We present a simpler proof of the known theorem that a fixed-point free homeomorphism on an n-dimens...
summary:We complement the literature by proving that for a fixed-point free map $f: X \to X$ the sta...
AbstractWe present a simpler proof of the known theorem that a fixed-point free homeomorphism on an ...
AbstractA topological version of a classical result of finite combinatorics concerning fixed point f...
summary:We complement the literature by proving that for a fixed-point free map $f: X \to X$ the sta...
summary:We complement the literature by proving that for a fixed-point free map $f: X \to X$ the sta...
AbstractFor every surface S there exists a natural number n(S) such that every map drawn on S can be...
We present a polynomial-time algorithm determining whether or not, for a fixed k, a P 5-free graph c...
We present a polynomial-time algorithm determining whether or not, for a fixed k, a P 5-free graph c...
AbstractA fixed-point free map f : X → X is said to be colorable with k colors if there exists a clo...
AbstractA fixed-point free map f: X → X is said to be colorable with k colors if there exists a clos...
AbstractA fixed-point free map f: X → X is said to be colorable with k colors if there exists a clos...
We investigate the color number and genus for fixed-point free maps of order three. A result that ha...
We investigate the color number and genus for fixed-point free maps of order three. A result that ha...
AbstractWe present a simpler proof of the known theorem that a fixed-point free homeomorphism on an ...
We present a simpler proof of the known theorem that a fixed-point free homeomorphism on an n-dimens...
summary:We complement the literature by proving that for a fixed-point free map $f: X \to X$ the sta...
AbstractWe present a simpler proof of the known theorem that a fixed-point free homeomorphism on an ...
AbstractA topological version of a classical result of finite combinatorics concerning fixed point f...
summary:We complement the literature by proving that for a fixed-point free map $f: X \to X$ the sta...
summary:We complement the literature by proving that for a fixed-point free map $f: X \to X$ the sta...
AbstractFor every surface S there exists a natural number n(S) such that every map drawn on S can be...
We present a polynomial-time algorithm determining whether or not, for a fixed k, a P 5-free graph c...
We present a polynomial-time algorithm determining whether or not, for a fixed k, a P 5-free graph c...
DOI
Add to ORKG