English
Related papers

Related papers: On Three Sets with Nondecreasing Diameter

200 papers

Erd\H{o}s, Pach, Pollack and Tuza [J. Combin. Theory, B 47, (1989), 279-285] conjectured that the diameter of a $K_{2r}$-free connected graph of order $n$ and minimum degree $\delta\geq 2$ is at most $\frac{2(r-1)(3r+2)}{(2r^2-1)}\cdot…

Combinatorics · Mathematics 2020-09-08 Éva Czabarka , Inne Singgih , László A. Székely

This paper begins by exploring some old and new results about Ramsey numbers and minimum numbers of monochromatic triangles in $2$-colorings of complete graphs, both in the disjoint and non-disjoint cases. We then extend the theory, by…

Combinatorics · Mathematics 2024-04-29 Jamie Bishop , Rebekah Kuss , Benjamin Peet

A subset $A$ of a Boolean algebra $B$ is said to be $(n,m)$-reaped if there is a partition of unity $P \subset B$ of size $n$ such that the cardinality of $\{b \in P: b \wedge a \neq \emptyset\}$ is greater than or equal to $m$ for all…

Logic · Mathematics 2008-02-03 A. Dow , J Steprāns , W. S. Watson

A graph is (m,k)-colourable if its vertices can be coloured with m colours such that the maximum degree of the subgraph induced on the set of all vertices receiving the same colour is at most k. The k-defective chromatic number $\chi_k(G)$…

Combinatorics · Mathematics 2015-01-20 Nirmala Achuthan , N. R. Achuthan , G. Keady

Let the diameter cover number, $D^t_r(G)$, denote the least integer $d$ such that under any $r$-coloring of the edges of the graph $G$, there exists a collection of $t$ monochromatic subgraphs of diameter at most $d$ such that every vertex…

Combinatorics · Mathematics 2021-05-18 Sean English , Connor Mattes , Grace McCourt , Michael Phillips

Let $\Delta,q\geq 3$ be integers. We prove that there exists $\eta\geq 0.002$ such that if $q\geq (2-\eta)\Delta$, then there exists an open set $\mathcal{U}\subset \mathbb{C}$ that contains the interval $[0,1]$ such that for each $w\in…

Combinatorics · Mathematics 2026-03-11 Ferenc Bencs , Khallil Berrekkal , Guus Regts

Improving upon the results of Freiman and Candela-Serra-Spiegel, we show that for a non-empty subset $A\subseteq\mathbb F_p$ with $p$ prime and $|A|<0.0045p$, (i) if $|A+A|<2.59|A|-3$ and $|A|>100$, then $A$ is contained in an arithmetic…

Number Theory · Mathematics 2019-12-10 Vsevolod F. Lev , Ilya D. Shkredov

A {\em cross-free} set of size $m$ in a Steiner triple system $(V,{\cal{B}})$ is three pairwise disjoint $m$-element subsets $X_1,X_2,X_3\subset V$ such that no $B\in {\cal{B}}$ intersects all the three $X_i$-s. We conjecture that for every…

Combinatorics · Mathematics 2015-09-21 Andras Gyarfas

Let $R_k(H;K_m)$ be the smallest number $N$ such that every coloring of the edges of $K_{N}$ with $k+1$ colors has either a monochromatic $H$ in color $i$ for some $1\leqslant i\leqslant k$, or a monochromatic $K_{m}$ in color $k+1$. In…

Combinatorics · Mathematics 2021-10-20 Zixiang Xu , Gennian Ge

Recently S. Goswami proved that whenever the set $\mathbb N$ of natural numbers is finitely colored, the set $\{a, b, ab, b(a+1)\}$ is monochromatic which also established a variant of the long-standing Hindman's conjecture, which asks for…

Combinatorics · Mathematics 2026-04-23 Md Moid Shaikh , Sourav Kanti Patra , Mukesh Kumar

In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too…

Number Theory · Mathematics 2007-05-23 Ernie Croot

We characterize numerical semigroups $S$ with embedding dimension three attaining equality in the inequality $\max\Delta(S)+2\leq \operatorname{cat}(S)$, where $\Delta(S)$ denotes the Delta set of $S$ and $\operatorname{cat}(S)$ denotes the…

Number Theory · Mathematics 2024-10-25 Pedro A. García-Sánchez , Helena Martín-Cruz

Extending results of Linial (1984) and Aigner (1985), we prove a uniform lower bound on the balance constant of a poset $P$ of width $2$. This constant is defined as $\delta(P) = \max_{(x, y)\in P^2}\min\{\mathbb{P}(x\prec y),…

Combinatorics · Mathematics 2021-06-21 Ashwin Sah

A hypergraph is said to be properly 2-colorable if there exists a 2-coloring of its vertices such that no hyperedge is monochromatic. On the other hand, a hypergraph is called non-2-colorable if there exists at least one monochromatic…

Combinatorics · Mathematics 2019-12-10 Sachin Aglave , V. A. Amarnath , Saswata Shannigrahi , Shwetank Singh

We address the problem of computing the minimum number of triangles to separate a set of blue points from a set of red points in $\mathbb{R}^2$. A set of triangles is a \emph{separator} of one color from the other if every point of that…

Computational Geometry · Computer Science 2025-03-10 Helena Bergold , Arun Kumar Das , Robert Lauff , Manfred Scheucher , Felix Schröder , Marie Diana Sieper

Let $X$ be a compact metric space and let $|A|$ denote the cardinality of a set $A$. We prove that if $f\colon X\to X$ is a homeomorphism and $|X|=\infty$ then for all $\delta>0$ there is $A\subset X$ such that $|A|=4$ and for all $k\in Z$…

Dynamical Systems · Mathematics 2014-04-03 Alfonso Artigue

Suppose that $M$ is a finitely-generated graded module of codimension $c\geq 3$ over a polynomial ring and that the regularity of $M$ is at most $2a-2$ where $a\geq 2$ is the minimal degree of a first syzygy of $M$. Then we show that the…

Commutative Algebra · Mathematics 2019-10-29 Adam Boocher , Derrick Wigglesworth

Given two positive integers $M$ and $k$, let $\B_k$ be the set of bases $q>1$ such that there exists a real number $x$ having exactly $k$ different $q$-expansions over the alphabet $\{0,1,\cdots,M\}$. In this paper we investigate the…

Number Theory · Mathematics 2015-07-30 Derong Kong , Wenxia Li , Yuru Zou

For $n \geq 225$ we show that every integer of the form $n + 2m$ such that $0 \leq 2m \leq n^{2} - \frac{9}{2} n \sqrt{n}$ is the dimension of a connected semi-simple subalgebra of $\mathrm{M}_{n}(k)$, that is, a subalgebra isomorphic to a…

Combinatorics · Mathematics 2019-08-19 Phillip Heikoop , Padraig Ó Catháin

Liu, Pach and S\'andor recently characterized all polynomials $p(z)$ such that the equation $x+y=p(z)$ is $2$-Ramsey, that is, any $2$-coloring of $\mathbb{N}$ contains infinitely many monochromatic solutions for $x+y=p(z)$. In this paper,…

Combinatorics · Mathematics 2024-04-02 Jaehoon Kim , Hong Liu , Péter Pál Pach