Related papers: Decomposing complete equipartite multigraphs into …

Let $G$ be an $n$-vertex graph obtained by adding chords to a cycle of length $n$. Markstr\"{o}m asked for the maximum number of edges in $G$ if there are no two cycles in $G$ with the same length. A simple counting argument shows that such…

A Not-All-Equal (NAE) decomposition of a graph $G$ is a decomposition of the vertices of $G$ into two parts such that each vertex in $G$ has at least one neighbor in each part. Also, a 1-in-Degree decomposition of a graph $G$ is a…

We consider distance colourings in graphs of maximum degree at most $d$ and how excluding one fixed cycle length $\ell$ affects the number of colours required as $d\to\infty$. For vertex-colouring and $t\ge 1$, if any two distinct vertices…

C. Thomassen (Proc. London Math. Soc. (3) 42 (1981), 231-251) gave a characterization of strongly connected non-Hamiltonian digraphs of order $p\geq 3$ with minimum degree $p-1$. In this paper we give an analogous characterization of…

Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…

We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…

We study properties of random subcomplexes of partitions returned by (a suitable form of) the Strong Hypergraph Regularity Lemma, which we call regular slices. We argue that these subcomplexes capture many important structural properties of…

Let $K(a^{(p)};\lambda,\mu )$ be a graph with $p$ parts, each part having size $a$, in which the multiplicity of each pair of vertices in the same part (in different parts) is $\lambda$ ($\mu $, respectively). In this paper we consider the…

We prove that octants are cover-decomposable into multiple coverings, i.e., for any k there is an m(k) such that any m(k)-fold covering of any subset of the space with a finite number of translates of a given octant can be decomposed into k…

Motivated to find the answers to some of the questions that have occurred in recent papers dealing with Hamiltonian cycles (abbreviated HCs) in some special classes of grid graphs we started the investigation of spanning unions of cycles,…

In this article we use the combinatorial and geometric structure of manifolds with embedded cylinders in order to develop an adiabatic decomposition of the Hodge cohomology of these manifolds. We will on the one hand describe the adiabatic…

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…

In this paper we count the number of paths and cycles in complete graphs by using the number $e$. Also, we compute the number of derangements in same way. Connection by $e$ yields some nice formulas for the number of derangements, such as…

We prove that for all $k\geq 4$ and $1\leq\ell<k/2$, every $k$-uniform hypergraph $\mathcal{H}$ on $n$ vertices with $\delta_{k-2}(\mathcal{H})\geq\left(\frac{4(k-\ell)-1}{4(k-\ell)^2}+o(1)\right)\binom{n}{2}$ contains a Hamiltonian…

In 1999, Jacobson and Lehel conjectured that for $k \geq 3$, every $k$-regular Hamiltonian graph has cycles of at least linearly many different lengths. This was further strengthened by Verstra\"{e}te, who asked whether the regularity can…

We give a polynomial-time algorithm for detecting very long cycles in dense regular graphs. Specifically, we show that, given $\alpha \in (0,1)$, there exists a $c=c(\alpha)$ such that the following holds: there is a polynomial-time…

It is shown that exactly 7 distance-transitive cubic graphs among the existing 12 possess a particular ultrahomogeneous property with respect to oriented cycles realizing the girth that allows the construction of a related Cayley digraph…

If $n$ is even, the $n$-dimensional hypercube can be decomposed into edge-disjoint cycles of length $2^i$ for every value of $i$ from $2$ to $n$.

A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomposed into (n-1)/2 edge-disjoint Hamilton cycles. We prove this conjecture for large n. In fact, we prove a far more general result, based on…