Related papers: Directed cycles with zero weight in $\mathbb{Z}_p^…

We fix a field $\kk$ of characteristic $p$. For a finite group $G$ denote by $\delta(G)$ and $\sigma(G)$ respectively the minimal number $d$, such that for any finite dimensional representation $V$ of $G$ over $\kk$ and any $v\in…

Let $A$ be a subset of the cyclic group $\mathbf{Z}/p\mathbf{Z}$ with $p$ prime. It is a well-studied problem to determine how small $|A|$ can be if there is no unique sum in $A+A$, meaning that for every two elements $a_1,a_2\in A$, there…

In a finite undirected simple graph, a chordless cycle is an induced subgraph which is a cycle. A graph is called cyclically orientable if it admits an orientation in which every chordless cycle is cyclically oriented. We propose an…

For a directed graph $G$, let $\mathrm{mindeg}(G)$ be the minimum among in-degrees and out-degrees of all vertices of $G$. It is easy to see that $G$ contains a directed cycle of length at least $\mathrm{mindeg}(G)+1$. In this note, we show…

We propose the following conjecture extending Dirac's theorem: if $G$ is a graph with $n\ge 3$ vertices and minimum degree $\delta(G)\ge n/2$, then in every orientation of $G$ there is a Hamilton cycle with at least $\delta(G)$ edges…

We consider the fundamental algorithmic problem of finding a cycle of minimum weight in a weighted graph. In particular, we show that the minimum weight cycle problem in an undirected n-node graph with edge weights in {1,...,M} or in a…

In [Curtin and Pourgholi, A group sum inequality and its application to power graphs, J. Algebraic Combinatorics, 2014], it is proved that among all directed power graphs of groups of a given order $ n $, the directed power graph of cyclic…

Understanding how the cycles of a graph or digraph behave in general has always been an important point of graph theory. In this paper, we study the question of finding a set of $k$ vertex-disjoint cycles (resp. directed cycles) of distinct…

For the Kautz digraph $K(d,D)$, let $\rho_k(d,D)$ be the number of oriented edges whose shortest directed cycle has length $k+1$, and define $\Delta_k(d,D) = \rho_k(d,D) - \rho_k(d,D-1)$. We give an exact, finite-dimensional matrix product…

We prove packing and counting theorems for arbitrarily oriented Hamilton cycles in ${\cal D}(n,p)$ for nearly optimal $p$ (up to a $\log ^cn$ factor). In particular, we show that given $t = (1-o(1))np$ Hamilton cycles $C_1,\ldots ,C_{t}$,…

Let $G$ be an $n$-node simple directed planar graph with nonnegative edge weights. We study the fundamental problems of computing (1) a global cut of $G$ with minimum weight and (2) a~cycle of $G$ with minimum weight. The best previously…

Let $G$ be a 2-connected graph of order $n$ and let $c$ be the circumference - the order of a longest cycle in $G$. In this paper we present a sharp lower bound for the circumference based on minimum degree $\delta$ and $p$ - the order of a…

For integers $k \geq 3$ and $r\geq 2$, we show that for every $\alpha> 0$, there exists $\varepsilon > 0$ such that the union of $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $\alpha n$ and a binomial random…

For a directed graph $G$, and a linear order $\ll$ on the vertices of $G$, we define backedge graph $G^\ll$ to be the undirected graph on the same vertex set with edge $\{u,w\}$ in $G^\ll$ if and only if $(u,w)$ is an arc in $G$ and $w \ll…

Let $G$ be a finite group of order $n$, and let $C_n$ be the cyclic group of order $n$. We show that $\sum_{g \in C_n} \phi(\mathrm{o}(g))\geq \sum_{g \in G} \phi(\mathrm{o}(g))$, with equality if and only if $G$ is isomorphic to $C_n$. As…

We prove directly that if E is a directed graph in which every cycle has an entrance, then there exists a C*-algebra which is co-universal for Toeplitz-Cuntz-Krieger E-families. In particular, our proof does not invoke ideal-structure…

In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. For digraphs, they showed that for every $\alpha>0$, there exists a constant $C$ such that for every $n$-vertex digraph of minimum…

Cohen et al. conjectured that for every oriented cycle $C$ there exist an integer $f(C)$ such that every strong $f(C)$-chromatic digraph contains a subdivision of $C$. El Joubbeh confirmed this conjecture for Hamiltonian digraphs. Indeed,…

In this paper, we study the minimal number of elements of maximal order within a zero-sumfree sequence in a finite Abelian p-group. For this purpose, in the general context of finite Abelian groups, we introduce a new number, for which…

Let $G$ be a finite group. Let $K/k$ be a Galois extension of number fields with Galois group isomorphic to $G$, and let $C \subseteq \mathrm{Gal}(K/k) \simeq G$ be a conjugacy invariant subset. It is well known that there exists an…