Related papers: Book Ramsey numbers I
An ordered graph is a simple graph with an ordering on its vertices. Define the ordered path $P_n$ to be the monotone increasing path with $n$ edges. The ordered size Ramsey number $\tilde{r}(P_r,P_s)$ is the minimum number $m$ for which…
For a real number $q>1$ and a positive integer $m$, let $Y_m(q):={\sum_{i=0}^n\epsilon_i q^i:\; \epsilon_i\in \{0, \pm 1,..., \pm m\}, n=0, 1,...}.$ In this paper, we show that $Y_m(q)$ is dense in ${\Bbb R}$ if and only if $q<m+1$ and $q$…
An open problem of arithmetic Ramsey theory asks if given a finite $r$-colouring $c:\mathbb{N}\to\{1,...,r\}$ of the natural numbers, there exist $x,y\in \mathbb{N}$ such that $c(xy)=c(x+y)$ apart from the trivial solution $x=y=2$. More…
Closed ordinal Ramsey numbers are a topological variant of the classical (ordinal) Ramsey numbers. We compute the exact value of the closed ordinal Ramsey number $R^{cl}(\omega^2,3) = \omega^6$.
The Ramsey number $R_X(p,q)$ for a class of graphs $X$ is the minimum $n$ such that every graph in $X$ with at least $n$ vertices has either a clique of size $p$ or an independent set of size $q$. We say that Ramsey numbers are linear in…
Several recent papers have considered the Ramsey-theoretic problem of how large a subset of integers can be without containing any 3-term geometric progressions. This problem has also recently been generalized to number fields, determining…
The theory of q-analogs develops many combinatorial formulas for finite vector spaces over a finite field with q elements--all in analogy with formulas for finite sets (which are the special case of q=1). A direct-sum decomposition of a…
We show that geometric thickness and book thickness are not asymptotically equivalent: for every t, there exists a graph with geometric thickness two and book thickness >= t.
In this paper we investigate algebraic properties of big Ramsey degrees in categories satisfying some mild conditions. As the first nontrivial consequence of the generalization we advocate in this paper we prove that small Ramsey degrees…
For a partially ordered set $(A, \le)$, let $G_A$ be the simple, undirected graph with vertex set $A$ such that two vertices $a \neq b\in A$ are adjacent if either $a \le b$ or $b \le a$. We call $G_A$ the \emph{partial order graph} or…
In our paper we study multiplicative properties of difference sets $A-A$ for large sets $A \subseteq \mathbb{Z}/q\mathbb{Z}$ in the case of composite $q$. We obtain a quantitative version of a result of A. Fish about the structure of the…
The Ramsey numbers $R(T_n,W_8)$ are determined for each tree graph $T_n$ of order $n\geq 7$ and maximum degree $\Delta(T_n)$ equal to either $n-4$ or $n-5$. These numbers indicate strong support for the conjecture, due to Chen, Zhang and…
The Ramsey number r(K_3,Q_n) is the smallest integer N such that every red-blue colouring of the edges of the complete graph K_N contains either a red n-dimensional hypercube, or a blue triangle. Almost thirty years ago, Burr and Erd\H{o}s…
We prove that the set of normalized differences between primes, defined as $S = \{(p-q)/(p+q) : p > q \text{ are primes}\}$, is dense in the open unit interval $(0,1)$. Our proof provides an explicit construction algorithm with quantitative…
In recent work by Mossel and Ross, it was asked how large $q$ has to be for a random jigsaw puzzle with $q$ different shapes of "jigs" to have exactly one solution. The jigs are assumed symmetric in the sense that two jigs of the same type…
The $r$-size-Ramsey number $\hat{R}_r(H)$ of a graph $H$ is the smallest number of edges a graph $G$ can have, such that for every edge-coloring of $G$ with $r$ colors there exists a monochromatic copy of $H$ in $G$. For a graph $H$, we…
Let P be a set of n points in R^d. How big is the largest subset X of P such that all of the distances determined between pairs are different? We show that X is at at least Omega(n^{1/6d}) This is not the best known; however the technique…
We compute the dimension $d_{n,r}(q) = \dim(\IR_q^r)$ of the defining module $\IR_q^r$ for the $q$-partition algebra. This module comes from $r$-iterations of Harish-Chandra restriction and induction on $\GL_n(\FF_q)$. This dimension is a…
A graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges in a graph any of whose proper edge colorings contains a totally multicolored copy of a graph H is the size anti-Ramsey number…
We say that a poset $Q$ contains a copy (resp.~an induced copy) of a poset $P$ if there is an injection $f : P \to Q$ such that for any $x,y \in P$, $f(x)\leq f(y)$ in $Q$ if (resp.~if and only if) $x\leq y$ in $P$. Let $\mathcal{Q}=\{Q_{n}…