Related papers: Multicorns are not Path Connected
We show that $\mathbb{C}^2$ contains pairs of properly embedded, smooth complex curves that are isotopic through homeomorphisms but not diffeomorphisms of $\mathbb{C}^2$. The construction is based on realizing corks as branched covers of…
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.
An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its $2$-connectedness. This infimum thickness can be computed thanks to the fully…
The generating function that records the sizes of directed circuit partitions of a connected 2-in, 2-out digraph D can be determined from the interlacement graph of D with respect to a directed Euler circuit; the same is true of the…
In 1992, Manoussakis conjectured that a strongly 2-connected digraph $D$ on $n$ vertices is hamiltonian if for every two distinct pairs of independent vertices $x,y$ and $w,z$ we have $d(x)+d(y)+d(w)+d(z)\geq 4n-3$. In this note we show…
A bicirculant is a regular graph that admits a semi-regular automorphism with two vertex-orbits of the same size. By $m$ we denote the size of vertex-orbits and by $d$ the valence of a bicirculant. Furthermore, we denote by $s$ the valence…
We present the notion of "cyclic double multicategory", as a structure in which to organise multivariable adjunctions and mates. The classic example of a 2-variable adjunction is the hom/tensor/cotensor trio of functors; we generalise this…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…
We study natural one-parameter families of antiholomorphic correspondences arising from univalent restrictions of Shabat polynomials, indexed by rooted dessin d'enfants. We prove that the parameter spaces are topological quadrilaterals,…
We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes…
C. Thomassen in \cite{[11]} suggested (see also \cite{[2]}, J. C.Bermond, C. Thomassen, Cycles in Digraphs - A survey, J. Graph Theory 5 (1981) 1-43, Conjectures 1.6.7 and 1.6.8) the following conjectures : 1. Every 3-strongly connected…
In this paper, we contribute toward a classification of two-variable polynomials by classifying (up to an automorphism of $C^2$) polynomials whose Newton polygon is either a triangle or a line segment. Our classification has several…
The study of the structural properties of large random planar graphs has become in recent years a field of intense research in computer science and discrete mathematics. Nowadays, a random planar graph is an important and challenging model…
Let D^r_+[0,1], r >= 1, denote the group of orientation-preserving C^r diffeomorphisms of [0,1]. We show that any two representations of Z^2 in D^r_+[0,1], r >= 2, are connected by a continuous path of representations of Z^2 in D^1_+[0,1].…
In this paper we study some geometrical objects (d-tensors, multi-time semisprays of polymomenta and nonlinear connections) on the dual 1-jet vector bundle $J^{1*}(\cal{T}, M)\to \cal{T}\times M$. Some geometrical formulas, which connect…
In this paper, we prove that: For any given finitely many distinct points $P_1,...,P_r$ and a closed subvariety $S$ of codimension $\geq 2$ in a complete toric variety over a uncountable (characteristic 0) algebraically closed field, there…
The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the…
It is well-known that all 2-knots are slice. Are all 2-links slice? This is an outstanding open question. In this paper we prove the following: For any 2-component 2-link (J,K)in the 4-sphere which bounds the 5-ball B^5, there is an…
We characterise the digraphs for which the multipaths, that is disjoint unions of directed paths, yield a matroid. For such graphs, called MP-digraphs, we prove that the Tutte polynomial of the multipath matroid is related to counting…
The 2-blowup of a graph is obtained by replacing each vertex with two non-adjacent copies; a graph is biplanar if it is the union of two planar graphs. We disprove a conjecture of Gethner that 2-blowups of planar graphs are biplanar:…