English
Related papers

Related papers: Extremal problems on the hypercube and the codegre…

200 papers

Let $G$ be a finite abelian group, and $r$ be a multiple of its exponent. The generalized Erd\H{o}s-Ginzburg-Ziv constant $s_r(G)$ is the smallest integer $s$ such that every sequence of length $s$ over $G$ has a zero-sum subsequence of…

Combinatorics · Mathematics 2020-04-07 Alexander Sidorenko

Let $G$ be a finite abelian group written additively, and let $r$ be a multiple of its exponent. The modified Erd\H{o}s-Ginzburg-Ziv constant $\mathsf{s}_r'(G)$ is the smallest integer $s$ such that every zero-sum sequence of length $s$…

Combinatorics · Mathematics 2023-09-13 Alexander Sidorenko

Let $G$ be a finite abelian group. The Erd{\H{o}}s-Ginzburg-Ziv constant $\mathsf s(G)$ of $G$ is defined as the smallest integer $l\in \mathbb{N}$ such that every sequence $S$ over $G$ of length $|S|\geq l$ has a zero-sum subsequence $T$…

Combinatorics · Mathematics 2015-09-16 Yushuang Fan , Qinghai Zhong

Let $G$ be a finite abelian group. The Erd{\H o}s--Ginzburg--Ziv constant $\mathsf s (G)$ of $G$ is defined as the smallest integer $l \in \mathbb N$ such that every sequence \ $S$ \ over $G$ of length $|S| \ge l$ \ has a zero-sum…

Number Theory · Mathematics 2011-03-07 Yushuang Fan , Weidong Gao , Qinghai Zhong

For an abelian group $G$ and an integer $t > 0$, the modified Erd\H{o}s-Ginzburg-Ziv constant $s'_t(G)$ is the smallest integer $\ell$ such that any zero-sum sequence of length at least $\ell$ with elements in $G$ contains a zero-sum…

Combinatorics · Mathematics 2019-07-29 Trajan Hammonds

For a finite abelian group $G$, the generalized Erd\H{o}s--Ginzburg--Ziv constant $\mathsf s_{k}(G)$ is the smallest $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. If $n =…

Combinatorics · Mathematics 2021-12-03 Jared Bitz , Sarah Griffith , Xiaoyu He

Let $r\ge 3$. Given an $r$-graph $H$, the minimum codegree $\delta_{r-1}(H)$ is the largest integer $t$ such that every $(r-1)$-subset of $V(H)$ is contained in at least $t$ edges of $H$. Given an $r$-graph $F$, the codegree Tur\'an density…

Combinatorics · Mathematics 2018-04-06 Allan Lo , Yi Zhao

For a finite abelian group $G$ and a positive integer $d$, let $\mathsf s_{d \mathbb N} (G)$ denote the smallest integer $\ell \in \mathbb N_0$ such that every sequence $S$ over $G$ of length $|S| \ge \ell$ has a nonempty zero-sum…

Number Theory · Mathematics 2010-07-05 Alfred Geroldinger , David J. Grynkiewicz , Wolfgang A. Schmid

Let $\mathcal{S}$ be a finite commutative semigroup written additively, and let $\exp(\mathcal{S})$ be its exponent which is defined as the least common multiple of all periods of the elements in $\mathcal{S}$. For every sequence $T$ of…

Combinatorics · Mathematics 2013-10-22 Sukumar Das Adhikari , Weidong Gao , Guoqing Wang

Let $G$ be a finite abelian group, and let $m>0$ with $\exp(G)\mid m$. Let $s_{m}(G)$ be the generalized Erd\H{o}s-Ginzburg-Ziv invariant which denotes the smallest positive integer $d$ such that any sequence of elements in $G$ of length…

Combinatorics · Mathematics 2013-05-01 Haiyan Zhang , Guoqing Wang

For an abelian group $G$ and an integer $t > 0$, the \emph{modified Erd\"os--Ginzburg--Ziv constant} $s_t'(G)$ is the smallest integer $\ell$ such that any zero-sum sequence of length at least $\ell$ with elements in $G$ contains a zero-sum…

Combinatorics · Mathematics 2018-08-28 Aaron Berger , Danielle Wang

If $G$ is a finite Abelian group, define $s_{k}(G)$ to be the minimal $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. Recently Bitz et al. proved that if $n = exp(G)$, then…

Combinatorics · Mathematics 2017-12-07 Jesse Geneson

Let $G$ be an additive finite abelian group with exponent $\exp(G)=m$. For any positive integer $k$, the $k$-th generalized Erd\H{o}s-Ginzburg-Ziv constant $\mathsf s_{km}(G)$ is defined as the smallest positive integer $t$ such that every…

Combinatorics · Mathematics 2018-11-27 Dongchun Han , Hanbin Zhang

For a finite abelian group $G$, the Erd\H{o}s-Ginzburg-Ziv constant $\mathfrak{s}(G)$ is the smallest $s$ such that every sequence of $s$ (not necessarily distinct) elements of $G$ has a zero-sum subsequence of length…

Combinatorics · Mathematics 2018-04-19 Jacob Fox , Lisa Sauermann

Let $G$ be a multiplicatively written finite group of order $n$. The Erd\H{o}s-Ginzburg-Ziv Theorem constant of the group $G$, denoted $\mathsf E(G)$, is defined as the smallest positive integer $\ell$ with the following property: for any…

Combinatorics · Mathematics 2026-03-24 Yang Zhao , Guoqing Wang

For a finite abelian group $G$ and a positive integer $k$, let $s_{k}(G)$ denote the smallest integer $\ell\in\mathbb{N}$ such that any sequence $S$ of elements of $G$ of length $|S|\geq\ell$ has a zero-sum subsequence with length $k$. The…

Combinatorics · Mathematics 2017-07-19 Xiaoyu He

Let $G=(V,E)$ be a graph of density $p$ on $n$ vertices. Following Erd\H{o}s, \L uczak and Spencer, an $m$-vertex subgraph $H$ of $G$ is called {\em full} if $H$ has minimum degree at least $p(m - 1)$. Let $f(G)$ denote the order of a…

Combinatorics · Mathematics 2016-10-24 Victor Falgas-Ravry , Klas Markström , Jacques Verstraëte

Let $k\geq 3$. Given a $k$-uniform hypergraph $H$, the minimum codegree $\delta(H)$ is the largest $d\in\mathbb{N}$ such that every $(k-1)$-set of $V(H)$ is contained in at least $d$ edges. Given a $k$-uniform hypergraph $F$, the codegree…

Combinatorics · Mathematics 2023-07-07 Simón Piga , Bjarne Schülke

The Erd\H{o}s-Ginzburg-Ziv constant of an abelian group $G$, denoted $\mathfrak{s}(G)$, is the smallest $k\in\mathbb{N}$ such that any sequence of elements of $G$ of length $k$ contains a zero-sum subsequence of length $\exp(G)$. In this…

Combinatorics · Mathematics 2023-03-13 Eric Naslund

Tur\'{a}n's theorem is a cornerstone of extremal graph theory. It asserts that for any integer $r \geq 2$ every graph on $n$ vertices with more than ${\tfrac{r-2}{2(r-1)}\cdot n^2}$ edges contains a clique of size $r$, i.e., $r$ mutually…

Combinatorics · Mathematics 2016-10-25 Christian Reiher
‹ Prev 1 2 3 10 Next ›