Related papers: Cutsets in ${\mathcal P}(X)$

This is a paper that aims to interpret the cardinality of a set in terms of Baire Category, i.e. how many closed nowhere dense sets can be deleted from a set before the set itself becomes negligible. . To do this natural tree-theoretic…

A subset of a Polish space $X$ is called universally small if it belongs to each ccc $\sigma$-ideal with Borel base on $X$. Under CH in each uncountable Abelian Polish group $G$ we construct a universally small subset $A_0\subset G$ such…

Let M denote the ideal of first category subsets of R. We prove that min{card X: X \subseteq R, X \not\in M} is the smallest cardinality of a family S \subseteq {0,1}^\omega with the property that for each f: \omega -> \bigcup_{n \in…

We show that in a rank supersolvable lattice that is graded by a bounded real interval, any antichain cutset is a level set for some appropriately constructed grading. As a consequence, given an antichain cutset in any of the measurable…

We prove that there are arbitrarily large indecomposable ordered sets T with a 2-chain C such that the smallest indecomposable proper superset U of C in T is T itself. Subsequently, we characterize all such indecomposable ordered sets T and…

In 1985, Chv\'{a}tal introduced the concept of star cutsets as a means to investigate the properties of perfect graphs, which inspired many researchers to study cutsets with some specific structures, for example, star cutsets, clique…

A product of compact normal spaces is normal; the product of a countably infinite collection of non-trivial spaces is normal if and only if it is countably paracompact and each of its finite sub-products is normal; if all powers of a space…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic…

Let $X$ be an algebraic variety with Gorenstein singularities. We define the notion of a wonderful resolution of singularities of $X$ by analogy with the theory of wonderful compactifications of semi-simple linear algebraic groups. We prove…

Answering a question of Sakai, we show that the minimal cardinality of a set of reals X such that C_p(X) does not have the Pytkeev property is equal to the pseudo-intersection number p. Our approach leads to a natural characterization of…

In Two-Sets Cut-Uncut, we are given an undirected graph $G=(V,E)$ and two terminal sets $S$ and $T$. The task is to find a minimum cut $C$ in $G$ (if there is any) separating $S$ from $T$ under the following ``uncut'' condition. In the…

Suppose that P is an infinite set of primes such that P = A + B + C, where A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x (where P(x) = the number of elements of P that are <= x), and if A,B,C is a "regular"…

A matching-cut of a graph is an edge cut that is a matching. The problem Matching-Cut is that of recognizing graphs with a matching-cut and is NP-complete, even if the graph belongs to one of a number of classes. We initiate the study of…

We show that if $X$ is a separable locally compact Hausdorff connected space with fewer than $\mathfrak c$ non-cut points, then $X$ embeds into a dendrite $D\subseteq \mathbb R ^2$, and the set of non-cut points of $X$ is a nowhere dense…

Four constructions result from a desire to create enhancements to Cantor's infinite real set cardinality. Each continues to keep Cantor's cardinality formulation in place while providing new comparisons of arbitrary infinite sets. To…

Given a finite set $V$, a convexity $\mathscr{C}$, is a collection of subsets of $V$ that contains both the empty set and the set $V$ and is closed under intersections. The elements of $\mathscr{C}$ are called convex sets. The digital…

We recall some abstract connectivity concepts, and apply them to special chains in partially ordered sets, called veins, that are defined as order-convex chains that are contained in every maximal chain they meet. Veins enable us to define…

The pinning down number $pd(X)$ of a topological space $X$ is the smallest cardinal $\kappa$ such that for every neighborhood assignment $\mathcal{U}$ on $X$ there is a set of size $\kappa$ that meets every member of $\mathcal{U}$. Clearly,…

We explore the concept of separating systems of vertex sets of graphs. A separating system of a set $X$ is a collection of subsets of $X$ such that for any pair of distinct elements in $X$, there exists a set in the separating system that…

By the {\em Suslinian number} $\Sln(X)$ of a continuum $X$ we understand the smallest cardinal number $\kappa$ such that $X$ contains no disjoint family $\C$ of non-degenerate subcontinua of size $|\C|\ge\kappa$. For a compact space $X$,…