Related papers: D'Angelo conjecture in the third gap interval

A path (resp. cycle) decomposition of a graph $G$ is a set of edge-disjoint paths (resp. cycles) of $G$ that covers the edge set of $G$. Gallai (1966) conjectured that every graph on $n$ vertices admits a path decomposition of size at most…

Let $D$ be a digraph on $p\geq 5$ vertices with minimum degree at least $p-1$ and with minimum semi-degree at least $p/2-1$. For $D$ (unless some extremal cases) we present a detailed proof of the following results [12]: (i) $D$ contains…

A classic theorem of Dirac from 1952 states that every graph with minimum degree at least n/2 contains a Hamiltonian cycle. In 1963, P\'osa conjectured that every graph with minimum degree at least 2n/3 contains the square of a Hamiltonian…

The Buratti-Horak-Rosa Conjecture concerns the possible multisets of edge-labels of a Hamiltonian path in the complete graph with vertex labels $0, 1, \ldots, {v-1}$ under a particular induced edge-labeling. The conjecture has been shown to…

Dirac's theorem determines the sharp minimum degree threshold for graphs to contain perfect matchings and Hamiltonian cycles. There have been various attempts to generalize this theorem to hypergraphs with larger uniformity by considering…

In 1982, Tuza conjectured that the size $\tau(G)$ of a minimum set of edges that intersects every triangle of a graph $G$ is at most twice the size $\nu(G)$ of a maximum set of edge-disjoint triangles of $G$. This conjecture was proved for…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…

We determine $\pi_*(BDiff_\partial(D^{2n})) \otimes \mathbb{Q}$ for $2n \geq 6$ completely in degrees $* \leq 4n-10$, far beyond the pseudoisotopy stable range. Furthermore, above these degrees we discover a systematic structure in these…

We investigate a conjecture on the cover times of planar graphs by means of large Monte Carlo simulations. The conjecture states that the cover time $\tau(G_{N})$ of a planar graph $G_{N}$ of $N$ vertices and maximal degree $d$ is lower…

Building on work of Doyle and Hyde on polynomial maps in one variable, we produce for each odd integer $d \geq 2$ a H\'enon map of degree $d$ defined over $\mathbb{Q}$ with at least $(d-4)^2$ integral periodic points. This provides a…

In this note we sketch a proof of a fundamental conjecture, the codimension-three conjecture, for microdifferential holonomic systems with regular singularities. It states that any regular holonomic E-module extends beyond a…

We give examples of birational selfmaps of $\mathbb{P}^d, d \geq 3$, whose dynamical degree is a transcendental number. This contradicts a conjecture by Bellon and Viallet. The proof uses a combination of techniques from algebraic dynamics…

The deck of a graph $X$, $D(X)$, is defined as the multiset of all vertex-deleted subgraphs of $X$. Two graphs are said to be hypomorphic, if they have the same deck. Kelly-Ulam conjecture states that any two hypomorphic graphs on at least…

We get three basic results in algebraic dynamics: (1). We give the first algorithm to compute the dynamical degrees to arbitrary precision. (2). We prove that for a family of dominant rational self-maps, the dynamical degrees are lower…

Let $G$ be a simple graph with order $n$, maximum degree $\D(G)$, minimum degree $\delta(G)$ and chromatic index $\chi'(G)$, respectively. A graph $G$ is called {\em $\D$-critical} if $\chi'(G)=\D(G)+1$ and $\chi'(H)\textless \chi'(G)$ for…

The famous Posa conjecture states that every graph of minimum degree at least 2n/3 contains the square of a Hamilton cycle. This has been proved for large n by Koml\'os, Sark\"ozy and Szemer\'edi. Here we prove that if p > n^{-1/2+\eps},…

We established a hyperplane restriction theorem for the local holomorphic mappings between projective spaces, which is inspired by the corresponding theorem of Green for homogeneous ideals in polynomial rings. Our theorem allows us to give…

Sidorenko's conjecture states that, for all bipartite graphs $H$, quasirandom graphs contain asymptotically the minimum number of copies of $H$ taken over all graphs with the same order and edge density. While still open for graphs, the…

We study conjectures relating degree conditions in $3$-partite hypergraphs to the matching number of the hypergraph, and use topological methods to prove special cases. In particular, we prove a strong version of a theorem of Drisko…

Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture.