English
Related papers

Related papers: Graph-Like Compacta: Characterizations and Euleria…

200 papers

We write the Euler characteristic X(G) of a four dimensional finite simple geometric graph G=(V,E) in terms of the Euler characteristic X(G(w)) of two-dimensional geometric subgraphs G(w). The Euler curvature K(x) of a four dimensional…

Geometric Topology · Mathematics 2013-07-16 Oliver Knill

We prove that each metrizable space (of cardinality less or equal to continuum) has a (first countable) uniform Eberlein compactification and each scattered metrizable space has a scattered hereditarily paracompact compactification. Each…

General Topology · Mathematics 2012-12-19 Taras Banakh , Arkady Leiderman

In this paper we introduce a graph structure, called subspace sum graph $\mathcal{G}(\mathbb{V})$ on a finite dimensional vector space $\mathbb{V}$ where the vertex set is the collection of non-trivial proper subspaces of a vector space and…

Combinatorics · Mathematics 2017-02-28 Angsuman Das

Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…

Dynamical Systems · Mathematics 2026-03-17 Joan Claramunt

A picture P of a graph G = (V,E) consists of a point P(v) for each vertex v in V and a line P(e) for each edge e in E, all lying in the projective plane over a field k and subject to containment conditions corresponding to incidence in G. A…

Combinatorics · Mathematics 2007-05-23 Jeremy L. Martin

For any connected component $H_0$ of the space of real meromorphic functions we build a compactification $N(H_0)$ of the space $H_0$. Then we express the Euler characteristics of the spaces $H_0$ and $N(H_0)$ in terms of topological…

Complex Variables · Mathematics 2017-08-22 S. V. Shadrin

We recall first Gallai-simplicial complex $\Delta_{\Gamma}(G)$ associated to Gallai graph $\Gamma(G)$ of a planar graph $G$. The Euler characteristic is a very useful topological and homotopic invariant to classify surfaces. In Theorems 3.2…

Algebraic Topology · Mathematics 2017-07-05 Imran Ahmed , Shahid Muhmood

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

Computational Complexity · Computer Science 2015-05-05 V. Arvind , Johannes Köbler , Gaurav Rattan , Oleg Verbitsky

Given a continuum $X$, let $C(X)$ be the hyperspace of all subcontinua of $X$. We consider the hyperspace $NC^{*}(X)=\{A\in C(X):X\setminus A$ is connected$\}$. In this paper we prove that the only locally connected continua $X$ for which…

General Topology · Mathematics 2025-06-30 Alejandro Illanes , Verónica Martínez-de-la-Vega , Jorge E. Vega

Suppose G is a topological group containing a (closed) topological copy of the Frechet-Urysohn fan. If G is a perfectly normal sequential space (a normal k-space) then every closed metrizable subset in $G$ is locally compact. Applying this…

General Topology · Mathematics 2011-08-23 Taras Banakh

We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex whose facets are the complements of sets of size $k$ in $V(G)$ inducing disconnected subgraphs of $G$. This generalizes the Alexander dual of a…

We describe the class of graphs for which all metric spaces with diametrical graphs belonging to this class are ultrametric. It is shown that a metric space $(X, d)$ is ultrametric iff the diametrical graph of the metric $d_{\varepsilon}(x,…

Metric Geometry · Mathematics 2021-03-18 Viktoriia Bilet , Oleksiy Dovgoshey , Yuriy Kononov

We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…

Logic in Computer Science · Computer Science 2017-03-28 Chansu Park , Ji-Won Park , Sewon Park , Dongseong Seon , Martin Ziegler

We prove the discrete Lusternik-Schnirelmann theorem telling that tcat(G) less or equal to crit(G) for a general simple graph G=(V,E). It relates the minimal number tcat(G) of in G contractible graphs covering G, with crit(G), the minimal…

Algebraic Topology · Mathematics 2012-11-15 Frank Josellis , Oliver Knill

A graph is $n$-e.c. ($n$-existentially closed) if for every pair of subsets $A, B$ of vertex set $V$ of the graph such that $A \cap B = \emptyset$ and $|A| + |B| = n$, there is a vertex $z$ not in $A \cup B$ joined to each vertex of $A$ and…

Combinatorics · Mathematics 2009-03-17 Le Anh Vinh

We provide characterizations of Lie groups as compact-like groups in which all closed zero-dimensional metric (compact) subgroups are discrete. The "compact-like" properties we consider include (local) compactness, (local)…

General Topology · Mathematics 2018-03-05 Dikran Dikranjan , Dmitri Shakhmatov

We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices…

Combinatorics · Mathematics 2020-07-29 Daniel Cizma , Nati Linial

For a separable locally compact but not compact metrizable space $X$, let $\alpha X = X \cup \{x_\infty\}$ be the one-point compactification with the point at infinity $x_\infty$. We denote by $EM(X)$ the space consisting of admissible…

General Topology · Mathematics 2022-02-18 Katsuhisa Koshino

A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…

Combinatorics · Mathematics 2023-11-17 Maria Chudnovsky , Daniel Cizma , Nati Linial

We develop a unified theory of Eulerian spaces by combining the combinatorial theory of infinite, locally finite Eulerian graphs as introduced by Diestel and K\"uhn with the topological theory of Eulerian continua defined as irreducible…

General Topology · Mathematics 2021-12-13 Paul Gartside , Max Pitz