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

It is consistent that for every monotonically increasing function f:omega->omega there is a graph with size and chromatic number aleph_1 in which every n-chromatic subgraph has at least f(n) elements (n >= 3). This solves a $250 problem of…

We give a short proof, that can be used in an introductory real analysis course, that if a function that is defined on the set of real numbers is continuous on a countable dense set, then it is continuous on an uncountable set. This is done…

It is proved that any countable index, universally measurable subgroup of a Polish group is open. By consequence, any universally measurable homomorphism from a Polish group into the infinite symmetric group $S_\infty$ is continuous. It is…

Schmidt's theorem is significantly generalized, to partitions in which periodic but otherwise arbitrary subsets of parts are counted or uncounted. The identification of such sets of partitions with colored partitions satisfying certain…

Let $X$ be a set, $\ka$ be a cardinal number and let $\iH$ be a family of subsets of $X$ which covers each $x\in X$ at least $\ka$ times. What assumptions can ensure that $\iH$ can be decomposed into $\kappa$ many disjoint subcovers? We…

The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…

For each nonnegative integer $g$, we classify the ramification types and monodromy groups of indecomposable coverings of complex curves $f: X\to Y$ where $X$ has genus $g$, under the hypothesis that $n:=\deg(f)$ is sufficiently large and…

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

An infinite game on the set of real numbers appeared in Matthew Baker's work [Math. Mag. 80 (2007), no. 5, pp. 377--380] in which he asks whether it can help characterize countable subsets of the reals. This question is in a similar spirit…

We prove that there exists a function $f:\mathbb{N}\rightarrow \mathbb{R}$ such that every directed graph $G$ contains either $k$ directed odd cycles where every vertex of $G$ is contained in at most two of them, or a set of at most $f(k)$…

A subset $A$ of a topological space $X$ is called relatively functionally countable (RFC) in $X$, if for each continuous function $f : X \to \mathbb{R}$ the set $f[A]$ is countable. We prove that all RFC subsets of a product…

We formulate and prove a dimension-theoretic generalization of the Lebesgue Covering Theorem. A generalized $n$-dimensional version of the Steinhaus Chessboard Theorem, recently proved by Turza\'nski and Ziajor, is a simple consequence of…

We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…

We construct families of explicit polynomials f with rational coefficients that are sums of squares of polynomials over the real numbers, but not over the rational numbers. Whether or not such examples exist was an open question originally…

The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…

Several important conjectures in Fractal Geometry can be summarised as follows: If the dimension of a self-similar measure in $\mathbb{R}$ does not equal its expected value, then the underlying iterated function system contains an exact…

We prove that every orientable infinite type surface without boundary and finite genus has a Riemann surface structure such that its modular group of quasiconformal homeomorphisms is countable.

Starting from a supercompact cardinal we build a model in which $2^{\aleph_{\omega_1}}=2^{\aleph_{\omega_1+1}}=\aleph_{\omega_1+3}$ but there is a jointly universal family of size $\aleph_{\omega_1+2}$ of graphs on $\aleph_{\omega_1+1}$.…

Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.

We prove that there exist functions $f$ and $g$ such that for all positive integers $k$ and $d$, for every graph $G$ and every subset $A$ of the vertices of $G$, either $G$ contains $k$ $A$-paths such that vertices of different $A$-paths…