相关论文: On disjoint Borel uniformizations

We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has…

We show that under the proper forcing axiom the class of all Aronszajn lines behave like $\sigma$-scattered orders under the embeddability relation. In particular, we are able to show that the class of better quasi order labeled fragmented…

We investigate the class of bipartite Borel graphs organized by the order of Borel homomorphism. We show that this class is unbounded by finding a jump operator for Borel graphs analogous to a jump operator of Louveau for Borel equivalence…

We show that the existence of a Suslin tree does not necessarily imply that there are uncountable minimal linear orders other than $\omega_1$ and $-\omega_1$, answering a question of J. Baumgartner. This is done by a Jensen-type iteration,…

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

It is presented the simplest known disproof of the Borsuk conjecture stating that if a bounded subset of n-dimensional Euclidean space contains more than n points, then the subset can be partitioned into n+1 nonempty parts of smaller…

We prove the following classification theorem of the ``Glimm -- Effros'' type for Borel order relations: a Borel partial order on the reals either is Borel linearizable or includes a copy of a certain Borel partial order $\meo$ which is not…

We consider a class of $n^{\text{th}}$-order linear ordinary differential equations with a large parameter $u$. Analytic solutions of these equations can be described by (divergent) formal series in descending powers of $u$. We demonstrate…

I prove that the Borel directed graphs whose vertex set admits a partition into two Borel acyclic sets form a $\mathbf\Sigma^1_2$-complete set; equivalently, that deciding whether a Borel directed graph has Borel dichromatic number at…

We prove that if there is a dominating family of size ${\aleph}_{1}$, then there is are ${\aleph}_{1}$ many compact subsets of ${\omega}^{\omega}$ whose union is a maximal almost disjoint family of functions that is also maximal with…

We prove that for an arbitrary subtree $T$ of $2^{<\omega}$ with each element extendable to a path, a given countable class $\mathcal{M}$ closed under disjoint union, and any set $A$, if none of the members of $\mathcal{M}$ strongly…

We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…

We prove that if two subsets ${A}$ and ${B}$ of the plane are connected, ${A}$ is bounded, and the Euclidean distance $\rho({A},{B})$ between ${A}$ and ${B}$ is greater than zero, then for every positive $\varepsilon<\rho({A},{B})$, the…

We give a complete solution to the Borel-Ritt problem in non-uniform spaces $\mathscr{A}^-_{(M)}(S)$ of ultraholomorphic functions of Beurling type, where $S$ is an unbounded sector of the Riemann surface of the logarithm and $M$ is a…

A $(k,\ell )$ partial partition of an $n$-element set is a collection of $\ell $ pairwise disjoint $k$-element subsets. It is proved that, if $n$ is large enough, one can find $\left\lfloor {n\choose k}/{\ell}\right\rfloor$ such partial…

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…

Jaligot's Lemma states that the Fitting subgroups of distinct Borel subgroups do not intersect in a tame minimal simple groups of finite Morley. Such a strong result appears hopeless without tameness. Here we use the 0-unipotence theory to…

We consider maps which are constructed from plane trees by assigning marks to the corners of each vertex and then connecting each pair of consecutive marks on their contour by a single edge. A measure is defined on the set of such maps by…

Let $M$ be a non-zero binary matrix with distinct rows where the rows are closed under certain logical operators. In this article, we investigate the existence of columns containing an equal or greater number of ones than zeros.…

We prove that if $\leq$ is an analytic partial order then either $\leq$ can be extended to a (boldface) $\Delta^1_2$ linear order similar to an antichain in $2^{<\omega_1}$ ordered lexicographically or a certain Borel partial order $\leq_0$…