Countably condensing multimaps and fixed points

Abstract

In this paper we present a generalization of the Daher's fixed point theorem to countably condensing multimaps. We obtain this result as a consequence of a new M\"onch type theorem for multimaps having weakly closed graph.

Keywords

• countably condensing multimap
• fixed point
• measure of noncompactness
• weakly closed graph
• quasi-convex set