Related papers: The Liouville and the intersection properties are …
For planar graphs, it is well known that high connectivity implies a Hamiltonian cycle and hence any 4-connected planar graph has a near-perfect matching. Nevertheless, whether 6-connected 1-planar graphs admit near-perfect matchings…
A graph on at least ${{k+1}}$ vertices is uniformly $k$-connected if each pair of its vertices is connected by $k$ and not more than $k$ independent paths. We reinvestigate a recent constructive characterization of uniformly $3$-connected…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
In this paper, we investigate some geometric properties of non-smooth random curves within a stochastic flow. We consider a polygonal line $\Gamma(\vec{u}_{1},\cdots,\vec{u}_{n})$, which connects the points…
Let $G$ be an infinite, locally finite graph. We investigate the relation between supercritical, transient branching random walk and the Martin boundary of its underlying random walk. We show results regarding the typical asymptotic…
We show bounds on total variation and $L^{\infty}$ mixing times, spectral gap and magnitudes of the complex valued eigenvalues of a general (non-reversible non-lazy) Markov chain with a minor expansion property. This leads to the first…
We prove that the number of Hamiltonian paths on the complement of an acyclic digraph is equal to the number of cycle covers. As an application, we obtain a new expansion of the chromatic symmetric function of incomparability graphs in…
It has been shown that univalent circle packings filling in the complex plane $\bold C$ are unique up to similarities of $\bold C$. Here we prove that bounded degree branched circle packings properly covering $\bold C$ are uniquely…
We study whether the probability distribution of a discrete quantum walk can get arbitrarily close to uniform, given that the walk starts with a uniform superposition of the outgoing arcs of some vertex. We establish a characterization of…
In this paper we are concerned with the existence of invariant curves of planar mappings which are quasi-periodic in the spatial variable, satisfy the intersection property, $\mathcal{C}^{p}$ smooth with $p>2n+1$, $n$ is the number of…
In this note we prove that the symplectic homology of a Liouville domain W displaceable in the symplectic completion vanishes. Nevertheless if the Euler characteristic of (W,\p W) is odd, the filtered symplectic homologies of W do not…
We construct a countable planar graph which, for any two vertices $u,v$ and any integer $k\ge 1$, contains $k$ edge-disjoint order-compatible $u$--$v$ paths but not infinitely many. This graph has applications in Ramsey theory, in the study…
Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with $n$ nodes is constructed as follows: each node selects a set of $K_n$ different items uniformly…
We prove that a typical compact set does not contain any similar copy of a given pattern. We also prove that a typical compact set of $[0,1]^{d} (d\geq 2)$ intersects any $(d-1)$-dimensional plane in at most $d$ points. We study the…
We prove a stability theorem for the elliptic Harnack inequality: if two weighted graphs are equivalent, then the elliptic Harnack inequality holds for harmonic functions with respect to one of the graphs if and only if it holds for…
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…
We prove several Liouville theorems for F-harmonic maps from some complete Riemannian manifolds by assuming some conditions on the Hessian of the distance function, the degrees of F(t) and the asymptotic behavior of the map at infinity. In…
We study Aldous' conjecture that the spectral gap of the interchange process on a weighted undirected graph equals the spectral gap of the random walk on this graph. We present a conjecture in the form of an inequality, and prove that this…
A mixed graph is cospectral to its converse, with respect to the usual adjacency matrices. Hence, it is easy to see that a mixed graph whose eigenvalues occur uniquely, up to isomorphism, must be isomorphic to its converse. It is therefore…
We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…