English
Related papers

Related papers: Closed graph property in Alexandroff spaces

200 papers

Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…

Information Theory · Computer Science 2023-08-08 Shahar Stein Ioushua , Ofer Shayevitz

For a continuous map on a topological graph containing a unique loop S it is possible to define the degree and, for a map of degree 1, rotation numbers. It is known that the set of rotation numbers of points in S is a compact interval and…

Dynamical Systems · Mathematics 2014-07-08 Sylvie Ruette

A space $X$ is called a $k_{R}$-space, if $X$ is Tychonoff and the necessary and sufficient condition for a real-valued function $f$ on $X$ to be continuous is that the restriction of $f$ on each compact subset is continuous. In this paper,…

Group Theory · Mathematics 2017-06-08 Fucai Lin , Shou Lin , Chuan Liu

We find universal spaces for Alexandroff and finite spaces and explore some of its topological properties as well as their description as inverse limits of finite spaces and Alexandroff extensions. They can be used as a natural environment…

General Topology · Mathematics 2024-12-02 Diego Mondéjar

In this paper, we introduce a graph structure, called non-zero component graph on finite dimensional vector spaces. We show that the graph is connected and find its domination number and independence number. We also study the…

General Mathematics · Mathematics 2021-11-09 Angsuman Das

A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…

Combinatorics · Mathematics 2016-11-04 Mohammad Hadi Shekarriz , Madjid Mirzavaziri

We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…

Computational Geometry · Computer Science 2015-07-16 David Eppstein

We show that if two tensor algebras of topological graphs are algebraically isomorphic, then the graphs are locally conjugate. Conversely, if the base space is at most one dimensional and the edge space is compact, then locally conjugate…

Operator Algebras · Mathematics 2010-04-06 Kenneth R. Davidson , Jean Roydor

Let $X$ and $Y$ be two graphs of order $n$. The friends-and-strangers graph $\textup{FS}(X,Y)$ of $X$ and $Y$ is a graph whose vertex set consists of all bijections $\sigma: V(X)\rightarrow V(Y)$, in which two bijections $\sigma$ and $…

Combinatorics · Mathematics 2025-04-02 Xinghui Zhao , Lihua You , Jifu Lin , Xiaoxue Zhang

We describe structural properties of strongly connected finite directed graphs, that are invariants of the topological conjugacy of their Markov-Dyck shifts. For strongly connected finite directed graphs with these properties topological…

Dynamical Systems · Mathematics 2019-06-11 Toshihiro Hamachi , Wolfgang Krieger

The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.

Combinatorics · Mathematics 2015-09-23 Marilena Crupi

A space is `n-arc connected' (n-ac) if any family of no more than n-points are contained in an arc. For graphs the following are equivalent: (i) 7-ac, (ii) n-ac for all n, (iii) continuous injective image of a closed sub-interval of the…

General Topology · Mathematics 2012-09-26 Benjamin Espinoza , Paul Gartside , Ana Mamatelashvili

We show that the space of continuous functions over a compact space X admits an equivalent pointwise-lowersemicontinuous locally uniformly rotund norm whenever X admits a fully closed map onto a compact Y such that C(Y) and the spaces of…

Functional Analysis · Mathematics 2023-12-27 Todor Manev

Let $Y$ be a metrizable space containing at least two points, and let $X$ be a $Y_{\mathcal{I}}$-Tychonoff space for some ideal $\mathcal{I}$ of compact sets of $X$. Denote by $C_{\mathcal{I}}(X,Y)$ the space of continuous functions from…

General Topology · Mathematics 2020-04-14 Saak Gabriyelyan , Alexander V. Osipov

We say that a metrizable space $M$ is a Krasinkiewicz space if any map from a metrizable compactum $X$ into $M$ can be approximated by Krasinkiewicz maps (a map $g\colon X\to M$ is Krasinkiewicz provided every continuum in $X$ is either…

General Topology · Mathematics 2008-03-28 Eiichi Matsuhashi , Vesko Valov

A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…

Combinatorics · Mathematics 2015-01-30 Jan Kynčl , János Pach , Radoš Radoičić , Géza Tóth

We prove that the mapping stack Map(Y,X) of topological stacks X and Y is again a topological stack if Y admits a compact groupoid presentation. If Y admits a locally compact groupoid presentation, we show that Map(Y,X) is a paratopological…

Algebraic Topology · Mathematics 2009-04-22 Behrang Noohi

A function $f:X\to Y$ between topological spaces is called {\em compact-preserving} if the image $f(K)$ of each compact subset $K\subset X$ is compact. We prove that a function $f:X\to Y$ defined on a strong Frechet space $X$ is…

General Topology · Mathematics 2013-05-28 Taras Banakh , Artur Bartoszewicz , Marek Bienias , Szymon Glab

Let $f$ be a piecewise continuous and monotonic map on the interval with at most finitely many discontinuities and turning points. In this paper we study properties about this class of maps and show its main difference from the continuous…

Dynamical Systems · Mathematics 2026-04-07 Kleyber Cunha , Marcio Gouveia , Paulo Santana

We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…

Combinatorics · Mathematics 2011-06-08 Reinhard Diestel , Julian Pott
‹ Prev 1 3 4 5 6 7 10 Next ›