中文
相关论文

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

200 篇论文

Given a non-degenerate Peano continuum $X$, a dimension function $D:2^X_*\to[0,\infty]$ defined on the family $2^X_*$ of compact subsets of $X$, and a subset $\Gamma\subset[0,\infty)$, we recognize the topological structure of the system…

一般拓扑 · 数学 2011-10-11 T. Banakh , N. Mazurenko

A family $\mathcal{P}$ of subgraphs of $G$ is called a {\it path cover} (resp. a {\it path partition}) of $G$ if $\bigcup _{P\in \mathcal{P}}V(P)=V(G)$ (resp. $\dot\bigcup _{P\in \mathcal{P}}V(P)=V(G)$) and every element of $\mathcal{P}$ is…

组合数学 · 数学 2021-11-02 Shuya Chiba , Michitaka Furuya

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…

逻辑 · 数学 2007-05-23 Arthur W. Apter

We show that it is consistent that the continuum is as large as you wish, and for each uncountable cardinal $\kappa$ below the continuum, there are a subset $T$ of the reals and a family $A$ of countable subsets of $T$ such that (1) both…

逻辑 · 数学 2010-03-15 Lajos Soukup

Recently, the authors gave Ramsey-type results for the path cover/partition number of graphs. In this paper, we continue the research about them focusing on digraphs, and find a relationship between the path cover/partition number and…

组合数学 · 数学 2021-11-30 Shuya Chiba , Michitaka Furuya

Given a function $f \in \omega^\omega$, a set $A \in [\omega]^\omega$ is free for $f$ if $f[A] \cap A$ is finite. For a class of functions $\Gamma \subseteq \omega^{\omega}$, we define $\mathfrak{ros}_\Gamma$ as the smallest size of a…

逻辑 · 数学 2024-04-11 Arturo Martínez-Celis , Tomasz Żuchowski

We study the set of numbers the total number of independent sets can admit in $n$-vertex graphs. In this paper, we prove that the cardinality $\mathcal{N}i(n)$ of this set is very close to $2^n$ in the following sense: $\mathcal{N}i(n)/2^n…

组合数学 · 数学 2025-10-07 Benedek Kovács , Zoltán Lóránt Nagy

Given a connected graph $G$, a set of vertices $X\subset V(G)$ is a weak $k$-resolving set of $G$ if for each two vertices $y,z\in V(G)$, the sum of the values $|d_G(y,x)-d_G(z,x)|$ over all $x\in X$ is at least $k$, where $d_G(u,v)$ stands…

The aim of this paper is to introduce a new weak separation axiom that generalizes the separation properties between $T_1$ and completely Hausdorff. We call a topological space $(X,\tau)$ a $T_{\kappa,\xi}$-space if every compact subset of…

一般拓扑 · 数学 2007-05-23 Francisco G. Arenas , Julian Dontchev , Maria Luz Puertas

We study the influence of the existence of large cardinals on the existence of wellorderings of power sets of infinite cardinals $\kappa$ with the property that the collection of all initial segments of the wellordering is definable by a…

逻辑 · 数学 2017-04-04 Philipp Lücke , Philipp Schlicht

We develop a version of Cichon's diagram for cardinal invariants on the generalized Cantor space 2^kappa or the generalized Baire space kappa^kappa where kappa is an uncountable regular cardinal. For strongly inaccessible kappa, many of the…

For a given graph consider a pair of disjoint matchings the union of which contains as many edges as possible. Furthermore, consider the relation of the cardinalities of a maximum matching and the largest matching in those pairs. It is…

离散数学 · 计算机科学 2009-03-03 A. V. Tserunyan

Let M be the ideal of first category subsets of R and non(M)=min{card X: X \subseteq R, X \not\in M}. We consider families \Phi of sequences converging to \infty, with the property that for every open set U \subseteq R that is unbounded…

逻辑 · 数学 2009-09-25 Apoloniusz Tyszka

An $\textit{isometric path}$ is a shortest path between two vertices. An $\textit{isometric path partition}$ (IPP) of a graph $G$ is a set $I$ of vertex-disjoint isometric paths in $G$ that partition the vertices of $G$. The…

组合数学 · 数学 2025-05-27 Irena Penev , R. B. Sandeep , D. K. Supraja , S. Taruni

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$. In…

组合数学 · 数学 2019-08-13 Mateusz Miotk , Jerzy Topp , Paweł Żyliński

For a strongly inacessible cardinal $\kappa$, we investigate the relationships between the following ideals: - the ideal of meager sets in the ${<}\kappa$-box product topology - the ideal of "null" sets in the sense of [Sh:1004]…

逻辑 · 数学 2023-05-04 Thomas Baumhauer , Martin Goldstern , Saharon Shelah

Given an uncountable cardinal $\kappa$, we consider the question of whether subsets of the power set of $\kappa$ that are usually constructed with the help of the Axiom of Choice are definable by $\Sigma_1$-formulas that only use the…

逻辑 · 数学 2023-09-20 Philipp Lücke , Sandra Müller

Let P be the direct product of countably many copies of the additive group Z of integers. We study, from a set-theoretic point of view, those subgroups of P for which all homomorphisms to Z annihilate all but finitely many of the standard…

逻辑 · 数学 2009-09-25 Andreas Blass

A space $X$ is said to be "cellular-Lindel\"of" if for every cellular family $\mathcal{U}$ there is a Lindel\"of subspace $L$ of $X$ which meets every element of $\mathcal{U}$. Cellular-Lindel\"of spaces generalize both Lindel\"of spaces…

一般拓扑 · 数学 2019-03-04 Angelo Bella , Santi Spadaro

We continue our study of Sierpinski-type colourings. In contrast to the prequel paper, we focus here on colourings for ideals stratified by their completeness degree. In particular, improving upon Ulam's theorem and its extension by Hajnal,…

逻辑 · 数学 2023-12-19 Tanmay Inamdar , Assaf Rinot