相关论文: Compatible Powers of Hamilton Cycles in Dense Grap…

We study the problem of finding a Hamiltonian cycle under the promise that the input graph has a minimum degree of at least $n/2$, where $n$ denotes the number of vertices in the graph. The classical theorem of Dirac states that such graphs…

The cycle space of a graph $G$, denoted $C(G)$, is a vector space over ${\mathbb F}_2$, spanned by all incidence vectors of edge-sets of cycles of $G$. If $G$ has $n$ vertices, then $C_n(G)$ is the subspace of $C(G)$, spanned by the…

We consider sufficient conditions for the existence of $k$-th powers of Hamiltonian cycles in $n$-vertex graphs $G$ with minimum degree $\mu n$ for arbitrarily small $\mu>0$. About 20 years ago Koml\'os, Sark\"ozy, and Szemer\'edi resolved…

Alon, Krivelevich, and Sudakov conjectured in 1999 that every $F$-free graph of maximum degree at most $\Delta$ has chromatic number $O(\Delta / \log \Delta)$. This was previously known only for almost bipartite graphs, that is, for…

We prove that for integers $2 \leq \ell < k$ and a small constant $c$, if a $k$-uniform hypergraph with linear minimum codegree is randomly `perturbed' by changing non-edges to edges independently at random with probability $p \geq…

A packing of a graph G with Hamilton cycles is a set of edge-disjoint Hamilton cycles in G. Such packings have been studied intensively and recent results imply that a largest packing of Hamilton cycles in G_n,p a.a.s. has size \lfloor…

In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. The main consequence of this…

A well-known conjecture of Alspach says that every $2k$-regular Cayley graph of an abelian group can be decomposed into Hamiltonian cycles. We consider an analogous question for infinite abelian groups. In this setting one natural analogue…

For a graph X, let f_0(X) denote its number of vertices, d(X) its minimum degree and Z_1(X;Z/2) its cycle space in the standard graph-theoretical sense (i.e. 1-dimensional cycle group in the sense of simplicial homology theory with…

In this paper, we construct the Rabinowitz-Floer homology for the coupled Dirac system \begin{equation*} \left\{ \begin{aligned} Du=\frac{\partial H}{\partial v}(x,u,v)\hspace{4mm} {\rm on} \hspace{2mm}M,\\ Dv=\frac{\partial H}{\partial…

Given a simple graph $G$, the {\it irregularity strength} of $G$, denoted by $s(G)$, is the least positive integer $k$ such that there is a weight assignment on edges $f: E(G) \to \{1,2,\dots, k\}$ attributing distinct weighted degrees:…

A loose Hamilton cycle in a hypergraph is a cyclic sequence of edges covering all vertices in which only every two consecutive edges intersect and do so in exactly one vertex. With Dirac's theorem in mind, it is natural to ask what minimum…

An infinite family of graphs ${\cal F}$ is called feasible if for any pair of integers $(n,m)$, $n \geq 1$, $0 \leq m \leq \binom{n}{2}$, there is a member $G \in {\cal F}$ such that $G$ has $n$ vertices and $m$ edges. We prove that given a…

For integers $k\geq 1$ and $n\geq 2k+1$, the Kneser graph $K(n,k)$ has as vertices all $k$-element subsets of an $n$-element ground set, and an edge between any two disjoint sets. It has been conjectured since the 1970s that all Kneser…

In this paper, we prove that for each $d \geq 2$, the union of a $d$-regular graph with a uniformly random $2$-factor on the same vertex set is Hamiltonian with high probability. This resolves a conjecture by Dragani\'c and Keevash for all…

After long-term efforts, the Hamilton path (cycle) problem for connected vertex-transitive graphs of order $pq$ (where $p$ and $q$ are primes) was finally resolved in 2021, see [10]. Fifteen years ago, mathematicians began addressing this…

Global forcing number and maximum anti-forcing number of matchable graphs (graphs with a perfect matching) were proposed in completely different situations with applications in theoretical chemistry. Surprisingly for bipartite graphs and…

The Hamiltonian cycle problem is to decide whether a given graph has a Hamiltonian cycle. Bertossi and Bonuccelli (1986, Information Processing Letters, 23, 195-200) proved that the Hamiltonian Cycle Problem is NP-Complete even for…

A pairing of a graph $G$ is a perfect matching of the complete graph having the same vertex set as $G$. If every pairing of $G$ can be extended to a Hamiltonian cycle of the underlying complete graph using only edges from $G$, then $G$ has…

Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is…