Related papers: Covering an uncountable square by countably many c…

We study the Baire class one countable colorings, i.e., the countable partitions into $F_\sigma$ sets. Such a partition gives a covering of the diagonal into countably many $F_\sigma$ squares. This leads to the study of countable unions of…

For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…

We introduce the model-companion of the theory of fields expanded by a unary function for a multiplicative map, which we call ACFH. Among others, we prove that this theory is NSOP$_1$ and not simple, that the kernel of the map is a generic…

Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all…

We show that countable increasing unions preserve a large family of well-studied covering properties, which are not necessarily sigma-additive. Using this, together with infinite-combinatorial methods and simple forcing theoretic methods,…

We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to $C_k$ for some $k$) instead of cycles (graphs with all degrees even). We give an…

Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…

When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…

The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…

Let M be a graph manifold. We prove that fundamental groups of embedded incompressible surfaces in M are separable in the fundamental group of M, and that the double cosets for crossing surfaces are also separable. We deduce that if there…

A. Hajnal and P. Erd\H{o}s proved that a graph with uncountable chromatic number cannot avoid short cycles, it must contain for example $ C_4 $ (among other obligatory subgraphs). It was shown recently by D. T. Soukup that, in contrast of…

In this article we will investigate nonmeasurability with respect to some $\sigma$-ideals in Polish space $X,$ of images of subsets of $X$ by selected mappings defined on the space $X$. Among of them we answer the following question: "It is…

It is proved the existence of large algebraic structures \break --including large vector subspaces or infinitely generated free algebras-- inside, among others, the family of Lebesgue measurable functions that are surjective in a strong…

We show that the continuum hypothesis implies there exists a Lindelof space X such that X x X is the union of two metrizable subspaces but X is not metrizable. This gives a consistent solution to a problem of Balogh, Gruenhage, and Tkachuk.…

A dichotomy discovered by Solecki says that a Baire class 1 function from a Souslin space into a Polish space either can be decomposed into countably many continuous functions, or else contains one particular function which cannot be so…

We focus our attention on well-covered graphs that are vertex decomposable. We show that for many known families of these vertex decomposable graphs, the set of shedding vertices forms a dominating set. We then construct three new infinite…

Let T be the family of open subsets of a topological space (not necessarily Hausdorff or even T_0). We prove that if T has a countable base and is not countable, then T has cardinality at least continuum.

We show that there is always a uniformly antisymmetric f:A-> {0,1} if A subset R is countable. We prove that the continuum hypothesis is equivalent to the statement that there is an f:R-> omega with |S_x| <= 1 for every x in R. If the…

We consider decompositions of the real line into pairwise disjoint Borel pieces so that each piece is closed under addition. How many pieces can there be? We prove among others that the number of pieces is either at most 3 or uncountable,…

Let $X$ be a smooth complex projective variety and let $H \in \pic(X)$ be an ample line bundle. Assume that $X$ is covered by rational curves with degree one with respect to $H$ and with anticanonical degree greater than or equal to $(\dim…