中文
相关论文

相关论文: The cardinal characteristic for relative gamma-set…

200 篇论文

A space $X$ is submaximal if any dense subset of $X$ is open. In this paper, we prove that every submaximal topological gyrogroup of non-measurable cardinality is strongly $\sigma$-discrete. Moreover, we prove that every submaximal strongly…

一般拓扑 · 数学 2020-11-11 Meng Bao , Fucai Lin

We provide a model where u(\kappa) < 2^{\kappa} for a supercompact cardinal \kappa. Garti and Shelah have provided a sketch of how to obtain such a model by modifying the construction in a paper of Dzamonja and Shelah; we provide here a…

逻辑 · 数学 2015-11-10 A. D. Brooke-Taylor , V. Fischer , S. D. Friedman , D. C. Montoya

In a graph G, cardinality of the smallest ordered set of vertices that distinguishes every element of V (G) is the (vertex) metric dimension of G. Similarly, the cardinality of such a set is the edge metric dimension of G, if it…

组合数学 · 数学 2020-10-21 Jelena Sedlar , Riste Škrekovski

The {\em metric dimension} of a graph $\Gamma$ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. We consider the Grassmann graph…

组合数学 · 数学 2011-11-28 Robert F. Bailey , Karen Meagher

A dominating set of a graph $G$ is a set $D\subseteq V_G$ such that every vertex in $V_G-D$ is adjacent to at least one vertex in $D$, and the domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. A set…

组合数学 · 数学 2021-01-18 Andrzej Lingas , Mateusz Miotk , Jerzy Topp , Paweł Żyliński

A dominating set of a graph $G=(V,E)$ is a vertex set $D$ such that every vertex in $V(G) \setminus D$ is adjacent to a vertex in $D$. The cardinality of a smallest dominating set of $D$ is called the domination number of $G$ and is denoted…

组合数学 · 数学 2022-06-16 Pawaton Kaemawichanurat , Odile Favaron

Let $\eta_{g}(n) $ be the smallest cardinality that $A\subseteq {\mathbb Z}$ can have if $A$ is a $g$-difference basis for $[n]$ (i.e, if, for each $x\in [n]$, there are {\em at least} $g$ solutions to $a_{1}-a_{2}=x$ ). We prove that the…

组合数学 · 数学 2025-01-22 Eric Schmutz , Michael Tait

We show that many large cardinal notions can be characterized in terms of the existence of certain elementary embeddings between transitive set-sized structures, that map their critical point to the large cardinal in question. In…

逻辑 · 数学 2017-08-22 Peter Holy , Philipp Lücke , Ana Njegomir

We call a pair of infinite cardinals $(\kappa,\lambda)$ with $\kappa > \lambda$ a dominating (resp. pinning down) pair for a topological space $X$ if for every subset $A$ of $X$ (resp. family $\mathcal{U}$ of non-empty open sets in $X$) of…

一般拓扑 · 数学 2020-11-23 István Juhász , Lajos Soukup , Zoltán Szentmiklóssy

A vertex $v$ is said to distinguish two other vertices $x$ and $y$ of a nontrivial connected graph G if the distance from $v$ to $x$ is different from the distance from $v$ to $y$. A set $S\subseteq V(G)$ is a local metric set for $G$ if…

We prove two ZFC theorems about cardinal invariants above the continuum which are in sharp contrast to well-known facts about these same invariants at the continuum. It is shown that for an uncountable regular cardinal $\kappa$,…

逻辑 · 数学 2018-01-30 Dilip Raghavan , Saharon Shelah

Let $G$ be a finite simple graph. For $X \subset V(G)$, the difference of $X$, $d(X) := |X| - |N (X)|$ where $N(X)$ is the neighborhood of $X$ and $\max \, \{d(X):X\subset V(G)\}$ is called the critical difference of $G$. $X$ is called a…

组合数学 · 数学 2018-03-21 Amitava Bhattacharya , Anupam Mondal , T. Srinivasa Murthy

We prove from suitable large cardinal hypotheses that the least weakly compact cardinal can be unfoldable, weakly measurable and even nearly $\theta$-supercompact, for any desired $\theta$. In addition, we prove several global results…

逻辑 · 数学 2013-05-28 Brent Cody , Moti Gitik , Joel David Hamkins , Jason Schanker

We introduce a covering notion depending on two cardinals, which we call $\mathcal O $-$ [ \mu, \lambda ]$-compactness, and which encompasses both pseudocompactness and many other generalizations of pseudocompactness. For Tychonoff spaces,…

一般拓扑 · 数学 2012-11-27 Paolo Lipparini

Using weaker versions of the cardinal function $\psi_c(X)$, we derive a series of new bounds for the cardinality of Hausdorff spaces and regular spaces that do not involve $\psi_c(X)$ nor its variants at all. For example, we show if $X$ is…

一般拓扑 · 数学 2023-01-18 Nathan Carlson

A subset $S$ of vertices of $G$ is a \textit{dominating set} of $G$ if every vertex in $V(G)-S$ has a neighbor in $S$. The \textit{domination number} \(\gamma(G)\) is the minimum cardinality of a dominating set of $G$. A dominating set $S$…

组合数学 · 数学 2025-09-26 Yuhan Ma

We show that all sufficiently nice $\lambda$-sets are countable dense homogeneous ($\mathsf{CDH}$). From this fact we conclude that for every uncountable cardinal $\kappa \le \mathfrak{b}$ there is a countable dense homogeneous metric space…

一般拓扑 · 数学 2018-09-19 Rodrigo Hernández-Gutiérrez , Michael Hrušák , Jan van Mill

Let $\Gamma$ denote a bipartite distance-regular graph with diameter $D \ge 4$ and valency $k \ge 3$. Let $X$ denote the vertex set of $\Gamma$, and let $A$ denote the adjacency matrix of $\Gamma$. For $x \in X$ let $T=T(x)$ denote the…

组合数学 · 数学 2016-11-23 Mark S. MacLean , Stefko Miklavic

Given a graph $G$ and a vertex $x\in V(G)$, a vertex set $S \subseteq V(G)$ is an $x$-geodominating set of $G$ if each vertex $v\in V(G)$ lies on an $x-y$ geodesic for some element $y\in S$. The minimum cardinality of an $x$-geodominating…

组合数学 · 数学 2013-11-18 J. Cáceres , M. Morales , M. L. Puertas

Baez asks whether the Euler characteristic (defined for spaces with finite homology) can be reconciled with the homotopy cardinality (defined for spaces with finite homotopy). We consider the smallest infinity category…

代数拓扑 · 数学 2019-07-02 John D. Berman