Related papers: A bridge between Dubovitskii - Federer theorems an…
A $c$-crossing-critical graph is one that has crossing number at least $c$ but each of its proper subgraphs has crossing number less than $c$. Recently, a set of explicit construction rules was identified by Bokal, Oporowski, Richter, and…
We establish Luzin $N$ and Morse-Sard properties for $BV_2$-functions defined on open domains in the plane. Using these results we prove that almost all level sets are finite disjoint unions of Lipschitz arcs whose tangent vectors are of…
A recent result of Bokal et al. [Combinatorica, 2022] proved that the exact minimum value of c such that c-crossing-critical graphs do not have bounded maximum degree is c=13. The key to that result is an inductive construction of a family…
We consider the chromatic number of the random Borsuk graph. The random Borsuk graph is obtained by sampling $n$ points i.i.d. uniformly at random on the $d$-dimensional sphere $S^d$, and joining a pair of points by an edge whenever their…
It is shown that if a proper holomorphic map $f: \mathbb C^n \to \mathbb C^N$, $1<n\le N$, sends a pseudoconvex real analytic hypersurface of finite type into another such hypersurface, then any $n-1$ dimensional component of the critical…
The generalization of the Morse theory presented by Goresky and MacPherson is a landmark that divided completely the topological and geo\-me\-tri\-cal study of singular spaces. Let \{$X_t\}_t$ be a suitable family of germs at $0$ of…
Answering an open question from 2007, we construct infinite $k$-crossing-critical families of graphs that contain vertices of any prescribed odd degree, for any sufficiently large~$k$. To answer this question, we introduce several…
A graph $G$ of order $n$ is said to be $k$-factor-critical for integers $1\leq k< n$, if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph is minimal if for every edge, the deletion of…
052<p type="texpara" tag="Body Text" et="abstract" >A completely $n$ -positive linear map from a locally $C^{\ast}$-algebra $A$ to another locally $C^{\ast}$-algebra $B $is an $n\times n$ matrix whose elements are continuous linear maps…
In [DKY], it was conjectured that there is a uniform bound $B$, depending only on the degree $d$, so that any pair of holomorphic maps $f, g :\mathbb{P}^1\to\mathbb{P}^1$ with degree $d$ will either share all of their preperiodic points or…
Given a number field K, we consider families of critically separable rational maps of degree d over K possessing a certain fixed-point and multiplier structure. With suitable notions of isomorphism and good reduction between rational maps…
An endomorphism $f:\mathbb{P}^k\to\mathbb{P}^k$ of degree $d\geq2$ is said to be postcritically finite (or PCF) if its critical set $\mathrm{Crit}(f)$ is preperiodic, i.e. if there are integers $m>n\geq0$ such that…
Assume that there exists a smooth map between two closed manifolds $M^m\to N^k$ with only finitely many cone-like singular points, where $2\leq k\leq m\leq 2k-1$. If $(m,k)\not\in\{(2,2), (4,3), (5,3), (8,5), (16,9)\}$, then $M^m$ admits a…
The long-standing topological Tverberg conjecture claimed, for any continuous map from the boundary of an $N(q,d):=(q-1)(d+1)$-simplex to $d$-dimensional Euclidian space, the existence of $q$ pairwise disjoint subfaces whose images have…
Motivated by the concept of transition system investigated by Kotzig in 1968, Krivelevich, Lee and Sudakov proposed a more general notion of incompatibility system to formulate the robustness of Hamiltonicity of Dirac graphs. Given a graph…
Given a family of graphs $\mathcal{F}$ and an integer $r$, we say that a graph is $r$-Ramsey for $\mathcal{F}$ if any $r$-colouring of its edges admits a monochromatic copy of a graph from $\mathcal{F}$. The threshold for the classic Ramsey…
The (n+1)-sphere contains a simple family of constant mean curvature (CMC) hypersurfaces which are products of lower-dimensional spheres called the generalized Clifford hypersurfaces. This paper demonstrates that new, topologically…
We observe that a recent result by Gardiner and Sj\"odin, solving a problem of Kr\'{a}l on subharmonic functions, can be easily generalized to yield a somewhat stronger result. This can be combined with a viscosity technique of ours, which…
The zero locus of a function f on a graph G is defined as the graph with vertex set consisting of all complete subgraphs of G, on which f changes sign and where x,y are connected if one is contained in the other. For d-graphs, finite simple…
Looking at the cartesian product X \times X of a topological space X with itself, a natural map to be considered on that object is the involution that interchanges the coordinates, i.e. that maps (x, y) to (y, x). The so-called 'symmetric…