English
Related papers

Related papers: Hyperspaces $C(p,X)$ of finite graphs

200 papers

A family of sets is $(p,q)$-intersecting if every nonempty subfamily of $p$ or fewer sets has at least $q$ elements in its total intersection. A family of sets has the $(p,q)$-Helly property if every nonempty $(p,q)$-intersecting subfamily…

Combinatorics · Mathematics 2022-02-01 Mitre C. Dourado , Luciano N. Grippo , Martín D. Safe

The symbol $\mathcal{S}(X)$ denotes the hyperspace of finite unions of convergent sequences in a Hausdorff space $X$. This hyperspace is endowed with the Vietoris topology. First of all, we give a characterization of convergent sequence in…

General Topology · Mathematics 2021-08-24 Jingling Lin , Fucai Lin , Chuan Liu

A class K of finite structures is said to have the extension property for automorphisms (EP) if for every A in K there exists an extension B in K such that every partial isomorphism on the structure A extends to an automorphism of B.…

Logic · Mathematics 2008-02-03 Bernhard Herwig

We study spaces $X$ for which the space $Hom_p(X)$ of automorphisms with the topology of point-wise convergence is a topological group. We identify large classes of spaces $X$ for which $Hom_p(X)$ is or is not a topological group.

General Topology · Mathematics 2024-06-28 Raushan Buzyakova

A set $X \subseteq V(G)$ in a graph $G$ is $(q,k)$-unbreakable if every separation $(A,B)$ of order at most $k$ in $G$ satisfies $|A \cap X| \leq q$ or $|B \cap X| \leq q$. In this paper, we prove the following result: If a graph $G$…

Combinatorics · Mathematics 2022-10-27 Daniel Lokshtanov , Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh

$c$-realcompact spaces are introduced by Karamzadeh and Keshtkar in Quaest. Math. 41(8), 2018, 1135-1167. We offer a characterization of these spaces $X$ via $c$-stable family of closed sets in $X$ by showing that $X$ is $c$-realcompact if…

General Topology · Mathematics 2022-02-15 Sudip Kumar Acharyya , Rakesh Bharati , Atasi Deb Ray

The Ramsey number $R_X(p,q)$ for a class of graphs $X$ is the minimum $n$ such that every graph in $X$ with at least $n$ vertices has either a clique of size $p$ or an independent set of size $q$. We say that Ramsey numbers are linear in…

Combinatorics · Mathematics 2020-12-07 Bogdan Alecu , Aistis Atminas , Vadim Lozin , Viktor Zamaraev

The kth finite subset space of a topological space X is the space exp_k X of non-empty finite subsets of X of size at most k, topologised as a quotient of X^k. The construction is a homotopy functor and may be regarded as a union of…

Geometric Topology · Mathematics 2007-05-23 Christopher Tuffley

For a metric continuum $X$, we consider the $n^{\tiny\textrm{th}}$-symmetric product $F_{n}(X)$ defined as the hyperspace of all nonempty subsets of $X$ with at most $n$ points. The homogeneity degree $hd(X)$ of a continuum $X$ is the…

General Topology · Mathematics 2018-09-19 Rodrigo Hernández-Gutiérrez , Verónica Martínez-de-la-Vega

Let $k,p,q$ be three positive integers. A graph $G$ with order $n$ is said to be $k$-placeable if there are $k$ edge disjoint copies of $G$ in the complete graph on $n$ vertices. A $(p,\,q)$-graph is a graph of order $p$ with $q$ edges.…

Combinatorics · Mathematics 2020-12-14 Yun Wang , Jin Yan

For a fixed graph $H$ and for arbitrarily large host graphs $G$, the number of homomorphisms from $H$ to $G$ and the number of subgraphs isomorphic to $H$ contained in $G$ have been extensively studied in extremal graph theory and graph…

Combinatorics · Mathematics 2021-07-05 Chun-Hung Liu

Let $1\le p<\infty$. A symmetric space $X$ on $[0,1]$ is said to be $p$-disjointly homogeneous (resp. restricted $p$-disjointly homogeneous) if every sequence of normalized pairwise disjoint functions from $X$ (resp. characteristic…

Functional Analysis · Mathematics 2019-03-19 S. Astashkin

The magnitude homology, introduced by R. Hepworth and S. Willerton, offers a topological invariant that enables the study of graph properties. Hypergraphs, being a generalization of graphs, serve as popular mathematical models for data with…

Algebraic Topology · Mathematics 2024-12-24 Wanying Bi , Jingyan Li , Jie Wu

A finite graph $\G$ is said to be {\em $(G,3)$-$($connected$)$ homogeneous} if every isomorphism between any two isomorphic (connected) subgraphs of order at most $3$ extends to an automorphism $g\in G$ of the graph, where $G$ is a group of…

Combinatorics · Mathematics 2022-10-20 Cai Heng Li , Jin-Xin Zhou

Let $H=(V,E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$, then $H$ is a $r$-uniform hypergraph; if $E$ consists of all…

Combinatorics · Mathematics 2018-08-03 Yingzhi Tian , Hong-Jian Lai , Jixiang Meng

We study the maximum number $ex(n,e,H)$ of copies of a graph $H$ in graphs with given number of vertices and edges. We show that for any fixed graph $H$, $ex(n,e,H)$ is asymptotically realized by the quasi-clique provided that the edge…

Combinatorics · Mathematics 2018-10-02 Dániel Gerbner , Dániel T. Nagy , Balázs Patkós , Máté Vizer

The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…

Combinatorics · Mathematics 2007-05-23 E. Babson , H. Barcelo , M. de Longueville , R. Laubenbacher

In this paper we consider the question of when the space $C_p(X)$ of continuous real-valued functions on $X$ with the pointwise convergence topology is countable dense homogeneous. In particular, we focus on the case when $X$ is countable…

General Topology · Mathematics 2022-01-19 Rodrigo Hernández-Gutiérrez

We characterise rigid graphs for cylindrical normed spaces $Z=X\oplus_\infty \mathbb{R}$ where $X$ is a finite dimensional real normed linear space and $Z$ is endowed with the product norm. In particular, we obtain purely combinatorial…

Metric Geometry · Mathematics 2023-05-16 Sean Dewar , Derek Kitson

We study the VC-dimension of the set system on the vertex set of some graph which is induced by the family of its $k$-connected subgraphs. In particular, we give tight upper and lower bounds for the VC-dimension. Moreover, we show that…

Discrete Mathematics · Computer Science 2016-02-03 Andrea Munaro