Related papers: Matchings in the hypercube with specified edges

Two plane drawings of graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. Let $S$ be a convex point set of $2n \geq 10$ points and let $\mathcal{H}$ be a family of…

Existence of a perfect matching in a random bipartite digraph with bipartition $(V_1, V_2)$, $|V_i|=n$, is studied. The graph is generated in two rounds of random selections of a potential matching partner such that the average number of…

A family of perfect matchings of $K_{2n}$ is $intersecting$ if any two of its members have an edge in common. It is known that if $\mathcal{F}$ is family of intersecting perfect matchings of $K_{2n}$, then $|\mathcal{F}| \leq (2n-3)!!$ and…

In this paper, we study the existence of perfect matchings and Hamiltonian cycles in the preferential attachment model. In this model, vertices are added to the graph one by one, and each time a new vertex is created it establishes a…

Let M and N be n-dimensional connected orientable finite-volume hyperbolic manifolds with geodesic boundary, and let f be a given isomorphism between the fundamental groups of M and N. We study the problem whether there exists an isometry…

Let $M$ be a complete Riemannian manifold, $N\in \NN$ and $p\ge 1$. We prove that almost everywhere on $x=(x_1,...,x_N)\in M^N$ for Lebesgue measure in $M^N$, the measure $\di \mu(x)=\f1N\sum_{k=1}^N\d_{x_k}$ has a unique $p$-mean $e_p(x)$.…

Let ($M$, $\Omega$) be a smooth symplectic manifold and $f:M\rightarrow M$ be a symplectic diffeomorphism of class $C^l$ ($l\geq 3$). Let $N$ be a compact submanifold of $M$ which is boundaryless and normally hyperbolic for $f$. We suppose…

Let $a,b$ be elements in a unital C$^*$-algebra with $0\leq a,b\leq 1$. The element $a$ is absolutely compatible with $b$ if $$\vert a - b \vert + \vert 1 - a - b \vert = 1.$$ In this note, we describe a complete list of absolutely…

A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The problem of finding such parallelepipeds or proving their non-existence is an old unsolved…

Let $(M, \dr M)$ be a 3-manifold with incompressible boundary that admits a convex co-compact hyperbolic metric. We consider the hyperbolic metrics on $M$ such that $\dr M$ looks locally like a hyperideal polyhedron, and we characterize the…

We show that optimal $L^2$-convergence in the finite element method on quasi-uniform meshes can be achieved if, for some $s_0 > 1/2$, the boundary value problem has the mapping property $H^{-1+s} \rightarrow H^{1+s}$ for $s \in [0,s_0]$.…

Let $H$ be a $3$-partite $3$-uniform hypergraph, i.e. a $3$-uniform hypergraph such that every edge intersects every partition class in exactly one vertex, with each partition class of size $n$. We determine a Dirac-type vertex degree…

A perfect matching of a complete graph $K_{2n}$ is a 1-regular subgraph that contains all the vertices. Two perfect matchings intersect if they share an edge. It is known that if $\mathcal{F}$ is family of intersecting perfect matchings of…

Let $ex(Q_n, H)$ be the largest number of edges in a subgraph $G$ of a hypercube $Q_n$ such that there is no subgraph of $G$ isomorphic to $H$. We show that for any integer $k\geq 3$, $$ex(Q_n, C_{4k+2})= O(n^{\frac{5}{6} +…

The \emph{thinness} of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Graphs with thinness at most two include, for example, bipartite convex graphs. Many…

In this paper we present a computer-assisted procedure for proving the existence of transverse heteroclinic orbits connecting hyperbolic equilibria of polynomial vector fields. The idea is to compute high-order Taylor approximations of…

We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in a 3-graph without isolated vertex. More precisely, suppose that $H$ is a 3-uniform hypergraph whose order $n$ is sufficiently large and…

It is proved that for $n \geq 6$, the number of perfect matchings in a simple connected cubic graph on $2n$ vertices is at most $4 f_{n-1}$, with $f_n$ being the $n$-th Fibonacci number. The unique extremal graph is characterized as well.…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

We develop new characteristic-independent combinatorial criteria for semiampleness of divisors on $\overline{M}_{0,n}$. As an application, we associate to a cyclic rational quadratic form satisfying a certain balancedness condition an…