Related papers: Baire-one mappings contained in a usco map
In this paper, we introduce the concept of monotone Gregus-\'Ciri\'c-contraction mappings in weighted digraphs. Then we establish a fixed point theorem for monotone Gregus-\'Ciri\'c-contraction mappings defined in convex weighted digraphs.
A seminal technique of theoretical physics called Wick's theorem interprets the Gaussian matrix integral of the products of the trace of powers of Hermitian matrices as the number of labelled maps with a given degree sequence, sorted by…
For a metrizable space, we consider the space of all metrics generating the same topology of the metrizable space, and this space of metrics is equipped with the supremum metric. In this paper, for every metrizable space, we establish that…
A Berge $k$-factor in a hypergraph is a generalization of a $k$-factor in a graph. In this paper, we study the problem of determining the values $k$ such that every $\lambda$-edge-connected $r$-regular hypergraph $\HH$ with $k|V(\HH)|$ even…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
We analyze the boundaries of multiply connected Fatou components of transcendental maps by means of universal covering maps and associated inner functions. A unified approach is presented, which includes invariant Fatou components (of any…
We prove distance bounds for graphs possessing positive Bakry-\'Emery curvature apart from an exceptional set, where the curvature is allowed to be non-positive. If the set of non-positively curved vertices is finite, then the graph admits…
The speed of a class of graphs counts the number of graphs on the vertex set $\lbrace 1,\dots, n\rbrace$ inside the class as a function of $n$. In this paper, we investigate this function for many classes of graphs that naturally arise in…
In this paper, we study the Bohr phenomenon for functions that are defined on a general simply connected domain of the complex plane. We improve known results of R. Fournier and St. Ruscheweyh for a class of analytic functions. Furthermore,…
In this article, we derive a common fixed point result for a pair of single valued and set-valued mappings on a metric space having graphical structure. In this case, the set-valued map is assumed to be closed valued instead of closed and…
A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…
Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an…
In this paper, we present an integral Suzuki-type fixed point theorem for multivalued mappings defined on a complete metric space in terms of the \'{C}iri\'{c} integral contractions. As an application, we will prove an existence and…
A topological space is called a submetrizable if it can be mapped onto a metrizable topological space by a continuous one-to-one map. In this paper we answer two questions concerning sequence-covering maps on submetrizable spaces.
In Gromov's treatise Partial Differential Relations (volume 9 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3), 1986), a continuous map between Riemannian manifolds is called isometric if it preserves the length of rectifiable…
For separable metrizable spaces $X,Y$ and a metrizable topological group $Z$ by $S(X\times Y,Z)$ we denote the space of all separately continuous functions $f:X\times Y\to Z$ endowed with the topology of layer-wise uniform convergence,…
It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show…
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree.
A graph is concave-round if its vertices can be circularly enumerated so that the closed neighbourhood of each vertex is an interval in the enumeration. In this work, we give a minimal forbidden induced subgraph characterization for the…
Generalized (rational) graph contractions in the framework of a dislocated metric space endowed with a directed graph are investigated. Fixed point results for set-contractions are obtained. We also provide some examples to illustrate our…