English
Related papers

Related papers: Zero sum cycles in complete digraphs

200 papers

In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs $G$ with $n$ vertices and $\Delta(G)\leq r$, which has the most…

Combinatorics · Mathematics 2014-05-07 Jonathan Cutler , A. J. Radcliffe

Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemma in the context of abelian groups and use it to derive some…

Combinatorics · Mathematics 2007-05-23 Ben Green

Let $C_2$ be the cyclic group of order $2$ and $D_{2n}$ be the dihedral group of order $2n$, where $n$ is even. In this paper, we provide the exact values of some zero-sum constants over $D_{2n} \times C_2$, namely small Davenport constant,…

Number Theory · Mathematics 2021-08-03 Fabio Enrique Brochero Martínez , Abílio Lemos , B. K. Moriya , Sávio Ribas

We analyze the dynamics of a class of $\mathbb{Z}_{2n}$-equivariant differential equations on the plane, depending on 4 real parameters. This study is the generalisation to $\mathbb{Z}_{2n}$ of previous works with $\mathbb{Z}_4$ and…

Dynamical Systems · Mathematics 2016-05-13 Isabel S. Labouriau , Adrian C. Murza

For a non-cyclic finite group $G$, let $\gamma(G)$ denote the smallest number of conjugacy classes of proper subgroups of $G$ needed to cover $G$. Bubboloni, Praeger and Spiga, motivated by questions in number theory, have recently…

Group Theory · Mathematics 2012-06-20 John R. Britnell , Attila Maroti

It was shown by Beisegel, Chudnovsky, Gurvich, Milani\v{c}, and Servatius in 2022 that every induced $2$-edge path in a vertex-transitive graph closes to an induced cycle. Similar results were obtained for 3-edge paths closing to cycles in…

Combinatorics · Mathematics 2025-10-08 Martin Milanič , Đorđe Mitrović

In the projective planes $\mathrm{PG}(2,q)$, we collect the smallest known sizes of complete arcs for the regions \begin{align*} &\mbox{all } q\le160001,~~ q \mbox{ prime power};\\ &Q_{4}=\{34 \mbox{ sporadic }q'\mbox{s in the interval…

For two integers $k$ and $\ell$, an $(\ell \text{ mod }k)$-cycle means a cycle of length $m$ such that $m\equiv \ell\pmod{k}$. In 1977, Bollob\'{a}s proved a conjecture of Burr and Erd\H{o}s by showing that if $\ell$ is even or $k$ is odd,…

Combinatorics · Mathematics 2025-07-18 Hojin Chu , Boram Park , Homoon Ryu

We show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices. We apply this…

Combinatorics · Mathematics 2019-04-29 Cesar Hernandez-Velez , Gelasio Salazar , Robin Thomas

We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all…

Combinatorics · Mathematics 2016-02-24 Kevin Henriot

Let $X$ be a product of smooth projective curves over a finite unramified extension $k$ of $\mathbb{Q}_p$. Suppose that the Albanese variety of $X$ has good reduction and that $X$ has a $k$-rational point. We propose the following…

Algebraic Geometry · Mathematics 2021-04-09 Evangelia Gazaki , Toshiro Hiranouchi

We consider the algorithmic problem of generating each subset of $[n]:=\{1,2,\ldots,n\}$ whose size is in some interval $[k,l]$, $0\leq k\leq l\leq n$, exactly once (cyclically) by repeatedly adding or removing a single element, or by…

Combinatorics · Mathematics 2018-02-16 Petr Gregor , Torsten Mütze

An infinite $(p,q)$-theorem, or an $(\aleph_0,q)$-theorem, involving two families $\mathcal{F}$ and $\mathcal{G}$ of sets, states that if in every infinite subset of $\mathcal{F}$, there are $q$ sets that are intersected by some set in…

Combinatorics · Mathematics 2025-09-12 Sutanoya Chakraborty , Arijit Ghosh

Dirac proved that each $n$-vertex $2$-connected graph with minimum degree at least $k$ contains a cycle of length at least $\min\{2k, n\}$. We consider a hypergraph version of this result. A Berge cycle in a hypergraph is an alternating…

Combinatorics · Mathematics 2024-03-01 Alexandr Kostochka , Ruth Luo , Grace McCourt

Hovey introduced $A$-cordial labelings as a generalization of cordial and harmonious labelings \cite{Hovey}. If $A$ is an Abelian group, then a labeling $f \colon V (G) \rightarrow A$ of the vertices of some graph $G$ induces an edge…

Combinatorics · Mathematics 2021-09-06 Sylwia Cichacz , Agnieszka Görlich , Zsolt Tuz

For a finite abelian group $G$ and a positive integer $h$, the unrestricted (resp.~restricted) $h$-critical number $\chi(G,h)$ (resp.~$\chi \hat{\;}(G,h)$) of $G$ is defined to be the minimum value of $m$, if exists, for which the $h$-fold…

Number Theory · Mathematics 2014-12-15 Bela Bajnok

We investigate the \textit{group irregularity strength} ($s_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\gr$ of order $s$, there exists a function $f:E(G)\rightarrow \gr$ such that the sums of edge…

Combinatorics · Mathematics 2017-12-01 Marcin Anholcer , Sylwia Cichacz

For an algebraic (n-1)-cycle Z on a complex projective (2n-1)-manifold X, P. Griffiths conjectured that, if Z is algebraically equivalent to zero and if the incidence divisor of Z on every family of (n-1)-cycles is principal, then the…

Algebraic Geometry · Mathematics 2013-02-21 Mirel Caibar , C. Herbert Clemens

We show that for each \ell\geq 4 every sufficiently large oriented graph G with \delta^+(G), \delta^-(G) \geq \lfloor |G|/3 \rfloor +1 contains an \ell-cycle. This is best possible for all those \ell\geq 4 which are not divisible by 3.…

Combinatorics · Mathematics 2009-08-13 Luke Kelly , Daniela Kühn , Deryk Osthus

A set $M$ of nonzero integers is said to split a finite abelian group $G$ if there exists a subset $S\subseteq G$ such that $M\cdot S = G\setminus\{0\}$. Such a splitting is called purely singular if every prime divisor of $|G|$ divides…

Combinatorics · Mathematics 2026-05-12 Ka Hin Leung , Tao Zhang