English
Related papers

Related papers: On the Closed Graph Theorem and the Open Mapping T…

200 papers

We investigate the question whether the (I)-envelope of any subset of a dual to a Banach space $X$ may be described as the closed convex hull in a suitable topology. If $X$ contains no copy of $\ell^1$ then the weak topology generated by…

Functional Analysis · Mathematics 2025-06-23 Ondřej F. K. Kalenda , Matias Raja

The main result of this paper states, that if a function $f:\R^2\to [0, +\infty)$ has a closed graph and the set of discontinuity points is a network (as defined by Kuratowski in Topology II, 61.IV), then the graph of $f$ is disconnected.…

General Topology · Mathematics 2013-07-17 Michal Stanislaw Wojcik

Let $G = (V, E)$ be a graph and $\lambda $ a non-negative integer. A graph $G$ is called a $(\lambda, 1)$-{\em graph} if $ (c0)$ $G$ is neither a complete graph no an edge-empty graph, $ (c1)$ every edge in $G$ belongs to exactly $\lambda$…

Combinatorics · Mathematics 2018-10-15 Rafael Aparicio , Alexander Kelmans

The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever…

General Topology · Mathematics 2015-09-28 Paul Gartside , Max F. Pitz , Rolf Suabedissen

Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…

Combinatorics · Mathematics 2026-05-13 Václav Blažej , Michał Pilipczuk , Evangelos Protopapas

The weak variant of Hanani-Tutte theorem says that a graph is planar, if it can be drawn in the plane so that every pair of edges cross an even number of times. Moreover, we can turn such a drawing into an embedding without changing the…

Computational Geometry · Computer Science 2016-05-06 Radoslav Fulek

This paper concerns the robust vector problems \begin{equation*} \mathrm{(RVP)}\ \ {\rm Wmin}\left\{ F(x): x\in C,\; G_u(x)\in -S,\;\forall u\in\mathcal{U}\right\}, \end{equation*} where $X, Y, Z$ are locally convex Hausdorff topological…

Optimization and Control · Mathematics 2019-10-24 Dinh Nguyen , Long Dang Hai

Convergence spaces are a generalization of topological spaces. The category of convergence spaces is well-suited for Algebraic Topology, one of the reasons is the existence of exponential objects provided by continuous convergence. In this…

Algebraic Topology · Mathematics 2024-12-24 Rodrigo Santos Monteiro

Let $X$ be a completely regular space. For a non-vanishing self-adjoint Banach subalgebra $H$ of $C_B(X)$ which has local units we construct the spectrum $\mathfrak{sp}(H)$ of $H$ as an open subspace of the Stone-Cech compactification of…

Functional Analysis · Mathematics 2017-06-19 M. Farhadi , M. R. Koushesh

We obtain a refinement of a selection principle for $(\mathcal{K}, \lambda)$-wide-$(s)$ sequences in Banach spaces due to Rosenthal. This result is then used to show that if $C$ is a bounded, non-weakly compact, closed convex subset of a…

Functional Analysis · Mathematics 2019-03-01 Cleon S. Barroso , Torrey M. Gallagher

A consistent path system in a graph $G$ is an collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We say that $G$ is strictly metrizable if every…

Combinatorics · Mathematics 2025-01-24 Maria Chudnovsky , Daniel Cizma , Nati Linial

For vector lattices $E$ and $F$, where $F$ is Dedekind complete and supplied with a locally solid topology, we introduce the corresponding locally solid absolute strong operator topology on the order bounded operators $\mathcal…

Functional Analysis · Mathematics 2023-05-31 Yang Deng , Marcel de Jeu

Rademacher theorem asserts that Lipschitz continuous functions between Euclidean spaces are differentiable almost everywhere. In this work we extend this result to set-valued maps using an adequate notion of set-valued differentiability…

Classical Analysis and ODEs · Mathematics 2022-12-14 Aris Daniilidis , Marc Quincampoix

It is well known that plane curves with the same endpoints are homotopic. An analogous claim for plane curves with the same endpoints and bounded curvature still remains open. In this work we find necessary and sufficient conditions for two…

Geometric Topology · Mathematics 2017-08-23 José Ayala

In [W. Mader, Connectivity keeping paths in $k$-connected graphs, J. Graph Theory 65 (2010) 61-69.], Mader conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$, every $k$-connected, finite graph $G$ with…

Combinatorics · Mathematics 2017-07-26 Yingzhi Tian , Jixiang Meng , Hong-Jian Lai , Liqiong Xu

A graph $G$ is {\it $n$-existentially closed} if, for all disjoint sets of vertices $A$ and $B$ with $|A\cup B|=n$, there is a vertex $z$ not in $A\cup B$ adjacent to each vertex of $A$ and to no vertex of $B$. In this paper, we investigate…

Combinatorics · Mathematics 2023-08-07 Andrea C. Burgess , Robert D. Luther , David A. Pike

A causal manifold $(M,\gamma)$ is a manifold $M$ endowed with a closed proper cone $\gamma$ in the tangent bundle $TM$ such that the projection $TM\to M$ is surjective when restricted to the interior of $\gamma$. Let $\lambda$ be the…

Algebraic Geometry · Mathematics 2025-10-30 Pierre Schapira

Menger's theorem tells us that if $S,T$ are sets of vertices in a graph $G$, then (for $k\ge0$) either there are $k+1$ vertex-disjoint paths between $S$ and $T$, or there is a set of $k$ vertices separating $S$ and $T$. But what if we want…

Combinatorics · Mathematics 2025-09-11 Tung Nguyen , Alex Scott , Paul Seymour

Quantum graphs have become in this century a favorite playground for mathematicians, mathematical physicists, and chemists, due to their manifold applications as models of thin structures, as well as presenting sometimes simpler playground…

Mathematical Physics · Physics 2024-06-25 Setenay Akduman , Peter Kuchment

Let $G=(V(G),E(G))$ be a finite simple undirected graph with vertex set $V(G)$, edge set $E(G)$ and vertex subset $S\subseteq V(G)$. $S$ is termed \emph{open-dominating} if every vertex of $G$ has at least one neighbor in $S$, and…

Discrete Mathematics · Computer Science 2023-06-22 Márcia R. Cappelle , Erika Coelho , Les R. Foulds , Humberto J. Longo
‹ Prev 1 8 9 10 Next ›