If $G$ is a graph and $\vec H$ is an oriented graph, we write $G\to \vec H$ to say that every orientation of the edges of $G$ contains $\vec H$ as a subdigraph. We consider the case in which $G=G(n,p)$, the binomial random graph. We determine the threshold $p_{\vec H}=p_{\vec H}(n)$ for the property $G(n,p)\to \vec H$ for the cases in which $\vec H$ is an acyclic orientation of a complete graph or of a cycle.
We determine the Ramsey number of a connected clique matching. That is, we show that if $G$ is a $2$-edge-coloured complete graph on $(r^2 - r - 1)n - r + 1$ vertices, then there is a monochromatic connected subgraph containing $n$ disjoint copies of $K_r$, and that this number of vertices cannot be reduced.
The Ramsey number r(K_s,Q_n) is the smallest positive integer N such that every red-blue colouring of the edges of the complete graph K_N on N vertices contains either a red n-dimensional hypercube, or a blue clique on s vertices. Answering a question of Burr and Erdős from 1983, and improving on recent results of Conlon, Fox, Lee and Sudakov, and of the current authors, we show that r(K_s,Q_n) = (s-1) (2^n - 1) + 1 for every s \in \N and every sufficiently large n \in \N.
We prove that $s_r(K_k) = O(k^5 r^{5/2})$, where $s_r(K_k)$ is the Ramsey parameter introduced by Burr, Erdős and Lovász in 1976, which is defined as the smallest minimum degree of a graph $G$ such that any $r$-colouring of the edges of $G$ contains a monochromatic $K_k$, whereas no proper subgraph of $G$ has this property. The construction used in our proof relies on a group theoretic model of generalised quadrangles introduced by Kantor in 1980.
If we 2-color the vertices of a large hypercube what monochromatic substructures are we guaranteed to find? Call a set S of vertices from Q_d, the d-dimensional hypercube, Ramsey if any 2-coloring of the vertices of Q_n, for n sufficiently large, contains a monochromatic copy of S. Ramsey's theorem tells us that for any r \geq 1 every 2-coloring of a sufficiently large r-uniform hypergraph will contain a large monochromatic clique (a complete subhypergraph): hence any set of vertices from Q_d that all have the same weight is Ramsey. A natural question to ask is: which sets S corresponding to u…
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertices. The Ramsey number r(Q_n, K_s) is the minimum N such that every graph of order N contains the cube graph Q_n or an independent set of order s. Burr and Erdos in 1983 asked whether the simple lower bound r(Q_n, K_s) >= (s-1)(2^n - 1)+1 is tight for s fixed and n sufficiently large. We make progress on this problem, obtaining the first upper bound which is within a constant factor of the lower bound.
Let $K_m^{(3)}$ denote the complete $3$-uniform hypergraph on $m$ vertices and $S_n^{(3)}$ the $3$-uniform hypergraph on $n+1$ vertices consisting of all $\binom{n}{2}$ edges incident to a given vertex. Whereas many hypergraph Ramsey numbers grow either at most polynomially or at least exponentially, we show that the off-diagonal Ramsey number $r(K_{4}^{(3)},S_n^{(3)})$ exhibits an unusual intermediate growth rate, namely, \[ 2^{c \log^2 n} \le r(K_{4}^{(3)},S_n^{(3)}) \le 2^{c' n^{2/3}\log n} \] for some positive constants $c$ and $c'$. The proof of these bounds brings in a novel Ramsey probl…
One formulation of the Erdos-Szekeres monotone subsequence theorem states that for any red/blue coloring of the edge set of the complete graph on $\{1, 2, \ldots, N\}$, there exists a monochromatic red $s$-clique or a monochromatic blue increasing path $P_n$ with $n$ vertices, provided $N >(s-1)(n-1)$. %We had previously shown that a suitable generalization of this problem to quadruple systems is essentially equivalent to classical diagonal hypergraph Ramsey numbers. Here, we prove a similar statement as above in the off-diagonal case for triple systems, with the quasipolynomial bound $N>2^{c(…
A graph $G$ is said to be $q$-Ramsey for a $q$-tuple of graphs $(H_1,\ldots,H_q)$, denoted by $G\to_q(H_1,\ldots,H_q)$, if every $q$-edge-coloring of $G$ contains a monochromatic copy of $H_i$ in color $i,$ for some $i\in[q]$. Let $s_q(H_1,\ldots,H_q)$ denote the smallest minimum degree of $G$ over all graphs $G$ that are minimal $q$-Ramsey for $(H_1,\ldots,H_q)$ (with respect to subgraph inclusion). The study of this parameter was initiated in 1976 by Burr, Erdős and Lovász, who determined its value precisely for a pair of cliques. Over the past two decades the parameter $s_q$ has been studie…
The 3-uniform tight cycle $C_s^3$ has vertex set $ Z_s$ and edge set $\{\{i, i+1, i+2\}: i \in Z_s\}$. We prove that for every $s \not\equiv 0$ (mod 3) and $s \ge 16$ or $s \in \{8,11,14\}$ there is a $c_s>0$ such that the 3-uniform hypergraph Ramsey number $$r(C_s^3, K_n^3)< 2^{c_s n \log n}$$ This answers in strong form a question of the author and Rödl who asked for an upper bound of the form $2^{n^{1+ε_s}}$ for each fixed $s \ge 4$, where $ε_s \rightarrow 0$ as $s \rightarrow \infty$ and $n$ is sufficiently large. The result is nearly tight as the lower bound is known to be exponential in …
A Sharp Ramsey Theorem for Admissible Colorings of Ordered Cliques
School of Science, Shanghai Institute of Technology（上海应用技术大学理学院）；School of Science, Shenyang Aerospace University（沈阳航空航天大学理学院）；School of Mathematical Sciences, Shenzhen University（深圳大学数学科学学院）
An important question in extremal graph theory raised by Vera T. Sós asks to determine for a given integer $t\ge 3$ and a given positive real number $δ$ the asymptotically supremal edge density $f_t(δ)$ that an $n$-vertex graph can have provided it contains neither a complete graph $K_t$ nor an independent set of size $δn$. Building upon recent work of Fox, Loh, and Zhao [The critical window for the classical Ramsey-Turán problem, Combinatorica 35 (2015), 435-476], we prove that if $δ$ is sufficiently small (in a sense depending on $t$), then \[ f_t(δ)= \begin{cases} \frac{3t-10}{3t-4}+δ-δ^2 &…
The multicolor Ramsey number problem asks, for each pair of natural numbers $\ell$ and $t$, for the largest $\ell$-coloring of a complete graph with no monochromatic clique of size $t$. Recent works of Conlon-Ferber and Wigderson have improved the longstanding lower bound for this problem. We make a further improvement by replacing an explicit graph appearing in their constructions by a random graph. Graphs useful for this construction are exactly those relevant for a problem of Erdős on graphs with no large cliques and few large independent sets. We also make some basic observations about thi…
Let $K\_{[k,t]}$ be the complete graph on $k$ vertices from which a set of edges, induced by a clique of order $t$, has been dropped. In this note we give two explicit upper bounds for $R(K\_{[k\_1,t\_1]},\dots, K\_{[k\_r,t\_r]})$ (the smallest integer $n$ such that for any $r$-edge coloring of $K\_n$ there always occurs a monochromatic $K\_{[k\_i,t\_i]}$ for some $i$). Our first upper bound contains a classical one in the case when $k\_1=\cdots =k\_r$ and $t\_i=1$ for all $i$. The second one is obtained by introducing a new edge coloring called {\em $χ\_r$-colorings}. We finally discuss a con…
Given a graph $H$ and a function $f:\mathbb{Z}^+ \longrightarrow \mathbb{Z}^+ $, the Ramsey-Turán number of $H$ and $f$, denoted by $RT(n, H, f(n))$, is the maximum number of edges a graph $G$ on $n$ vertices can have, which does not contain $H$ as a subgraph and also does not contain a set of $f(n)$ independent vertices. Let $r$ be a positive integer. In 1969, Erdős and Sós proved that $RT(n,K_{2r+1},o(n))=\frac{n^2}{2}(1-\frac{1}{r})+o(n^2)$. Let $F_k(2r+1)$ denote the graph consisting of $k$ copies of complete graphs $K_{2r+1}$ sharing exactly one vertex. In this paper, we show that $RT(n,F…
For $s \ge 4$, the 3-uniform tight cycle $C^3_s$ has vertex set corresponding to $s$ distinct points on a circle and edge set given by the $s$ cyclic intervals of three consecutive points. For fixed $s \ge 4$ and $s \not\equiv 0$ (mod 3) we prove that there are positive constants $a$ and $b$ with $$2^{at}<r(C^3_s, K^3_t)<2^{bt^2\log t}.$$ The lower bound is obtained via a probabilistic construction. The upper bound for $s>5$ is proved by using supersaturation and the known upper bound for $r(K_4^{3}, K_t^3)$, while for $s=5$ it follows from a new upper bound for $r(K_5^{3-}, K_t^3)$ that we de…
A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of H. Two graphs H and H' are Ramsey-equivalent if every graph G is Ramsey for H if and only if it is Ramsey for H'. In this paper, we study the problem of determining which graphs are Ramsey-equivalent to the complete graph K_k. A famous theorem of Nesetril and Rodl implies that any graph H which is Ramsey-equivalent to K_k must contain K_k. We prove that the only connected graph which is Ramsey-equivalent to K_k is itself. This gives a negative answer to the question of Szabo, Zumstein, and Zurch…
Recently Kostochka, Mubayi and Verstraëte initiated the study of the Ramsey numbers of uniform loose cycles versus cliques. In particular they proved that $R(C^r_3,K^r_n) = \tildeθ(n^{3/2})$ for all fixed $r\geq 3$. For the case of loose cycles of length five they proved that $R(C_5^r,K_n^r)=Ω((n/\log n)^{5/4})$ and conjectured that $R(C^r_5,K_n^r) = O(n^{5/4})$ for all fixed $r\geq 3$. Our main result is that $R(C_5^3,K_n^3) = O(n^{4/3})$ and more generally for any fixed $l\geq 3$ that $R(C_l^3,K_n^3) = O(n^{1 + 1/\lfloor(l+1)/2 \rfloor})$. We also explain why for every fixed $l\geq 5$, $r\ge…
Given a graph H, a graph G is called a Ramsey graph of H if there is a monochromatic copy of H in every coloring of the edges of G with two colors. Two graphs G, H are called Ramsey equivalent if they have the same set of Ramsey graphs. Fox et al. [J. Combin. Theory Ser. B 109 (2014), 120--133] asked whether there are two non-isomorphic connected graphs that are Ramsey equivalent. They proved that a clique is not Ramsey equivalent to any other connected graph. Results of Nesetril et al. showed that any two graphs with different clique number [Combinatorica 1(2) (1981), 199--202] or different o…
In this paper we introduce a general framework for proving lower bounds for various Ramsey type problems within random settings. The main idea is to view the problem from an algorithmic perspective: we aim at providing an algorithm that finds the desired colouring with high probability. Our framework allows to reduce the probabilistic problem of whether the Ramsey property at hand holds for random (hyper)graphs with edge probability $p$ to a deterministic question of whether there exists a finite graph that forms an obstruction. In the second part of the paper we apply this framework to addres…
The size Ramsey number $ \hat{r}(G,H) $ of two graphs $ G $ and $ H $ is the smallest integer $ m $ such that there exists a graph $ F $ on $ m $ edges with the property that every red-blue colouring of the edges of $ F $, yields a red copy of $ G $ or a blue copy of $ H $. In $ 1981 $, Erdős observed that $\hat{r}(K_{1,k},K_{3})\leq \binom{2k+1}{2}-\binom{k}{2}$ and he conjectured that the corresponding upper bound on $ \hat{r}(K_{1,k},K_{3}) $ is sharp. In $ 1983 $, Faudree and Sheehan extended this conjecture as follows: \hat{r}(K_{1,k},K_{n})=\left \{ {lr} \binom{k(n-1)+1}{2}-\binom{k}{2} …
For graphs $F$ and $H$, we say $F$ is Ramsey for $H$ if every $2$-coloring of the edges of $F$ contains a monochromatic copy of $H$. The graph $F$ is Ramsey $H$-minimal if $F$ is Ramsey for $H$ and there is no proper subgraph $F'$ of $F$ so that $F'$ is Ramsey for $H$. Burr, Erdos, and Lovasz defined $s(H)$ to be the minimum degree of $F$ over all Ramsey $H$-minimal graphs $F$. Define $H_{t,d}$ to be a graph on $t+1$ vertices consisting of a complete graph on $t$ vertices and one additional vertex of degree $d$. We show that $s(H_{t,d})=d^2$ for all values $1<d\le t$; it was previously known t…
An r-book of size q is a union of q (r+1)-cliques sharing a common r-clique. We find exactly the Ramsey number of a p-clique versus r-books of sufficiently large size. Furthermore, we find asymptotically the Ramsey number of any fixed p-chromatic graph versus r-books of sufficiently large size. The key element in our proofs is Szemeredi's Regularity Lemma.
A construction described by the current author in 2017 uses two linear `prototype' graphs to build a compound graph with Ramsey properties inherited from the prototypes. This paper describes a generalisation of that construction which has produced improved lower bounds in many cases for multicolour Ramsey numbers. The resulting graphs are linear, as before, and under certain specific conditions set out here, they can be cyclic. The mechanism of the new construction requires that the first prototype contains a triangle-free `template' in one colour, with defined properties. This paper shows tha…
The size Ramsey number of a graph $H$ is defined as the minimum number of edges in a graph $G$ such that there is a monochromatic copy of $H$ in every two-coloring of $E(G)$. The size Ramsey number was introduced by Erdős, Faudree, Rousseau, and Schelp in 1978 and they ended their foundational paper by asking whether one can determine up to a constant factor the size Ramsey numbers of three families of graphs: complete bipartite graphs, book graphs (obtained by adding many common neighbors to the vertices of a clique), and starburst graphs (obtained by adding many pendant edges to each vertex …
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 this short note, we study the lower bound for $R_k(H;K_m)$ when $H$ is $C_5$ or $C_7$, respectively. We show that \begin{equation*} R_{k}(C_5;K_m)=Ω(m^{\frac{3k}{8}+1}/(\log{m})^{\frac{3k}{8}+1}), \end{equation*} and \begin{equation*} R_{k}(C_7;K_m)=Ω(m^{\frac{2k}{9}+1}/(\log{m})^{\frac{2k}{9}+1}), \end{equation*} for fixed positive integer $k$ and $m\rightarro…
Let Q(n,c) denote the minimum clique size an n-vertex graph can have if its chromatic number is c. Using Ramsey graphs we give an exact, albeit implicit, formula for the case c is at least (n+3)/2.
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 $X$ if there is a constant $k$ such that $R_{X}(p,q) \leq k(p+q)$ for all $p,q$. In the present paper we conjecture that if $X$ is a hereditary class defined by finitely many forbidden induced subgraphs, then Ramsey numbers are linear in $X$ if and only if $X$ excludes a forest, a disjoint union of cliques and their complements. We prove the "only if" part of …
We say that $G \to (F,H)$ if, in every edge colouring $c: E(G) \to \{1,2\}$, we can find either a $1$-coloured copy of $F$ or a $2$-coloured copy of $H$. The well-known Kohayakawa--Kreuter conjecture states that the threshold for the property $G(n,p) \to (F,H)$ is equal to $n^{-1/m_{2}(F,H)}$, where $m_{2}(F,H)$ is given by \[ m_{2}(F,H):= \max \left\{\dfrac{e(J)}{v(J)-2+1/m_2(H)} : J \subseteq F, e(J)\ge 1 \right\}. \] In this paper, we show the $0$-statement of the Kohayakawa--Kreuter conjecture for every pair of cycles and cliques.
Explicit construction of Ramsey graphs has remained a challenging open problem for a long time. Frankl--Wilson \cite{FW}, Alon \cite{A} and Grolmusz \cite{G2} gave the best explicit constructions of graphs on $m$ vertices with no clique or independent set of size $m^{(1+o(1))\frac{1}{4}\frac{\log m}{\log \log m}}$. We describe here an explicit construction which produces for every integer $m>1$ a graph on at least $m^{(1+o(1))\frac{1}{3}\frac{\log m}{\log \log m}}$ vertices containing neither a clique of size $m$ nor an independent set of size $m$. In the proof we use the polynomial subspace m…
Given graphs $H_1,H_2$, a graph $G$ is $(H_1,H_2)$-Ramsey if for every colouring of the edges of $G$ with red and blue, there is a red copy of $H_1$ or a blue copy of $H_2$. In this paper we investigate Ramsey questions in the setting of randomly perturbed graphs: this is a random graph model introduced by Bohman, Frieze and Martin in which one starts with a dense graph and then adds a given number of random edges to it. The study of Ramsey properties of randomly perturbed graphs was initiated by Krivelevich, Sudakov and Tetali in 2006; they determined how many random edges must be added to a …
The graph $G$ is called a $(3, 3)$-Ramsey graph if in every coloring of the edges of $G$ in two colors there is a monochromatic triangle. The minimum number of vertices of the $(3, 3)$-Ramsey graphs without 4-cliques is denoted by $F_e(3, 3; 4)$. The number $F_e(3, 3; 4)$ is referred to as the most wanted Folkman number. It is known that $20 \leq F_e(3, 3; 4) \leq 786$. In this paper we prove that if $G$ is an $n$-vertex $(3, 3)$-Ramsey graph without 4-cliques, then $α(G) \leq n - 16$, where $α(G)$ denotes the independence number of $G$. Using the newly obtained bound on $α(G)$ and complex com…
In a seminal paper from 1983, Burr and Erdos started the systematic study of Ramsey numbers of cliques vs. large sparse graphs, raising a number of problems. In this paper we develop a new approach to such Ramsey problems using a mix of the Szemeredi regularity lemma, embedding of sparse graphs, Turan type stability, and other structural results. We give exact Ramsey numbers for various classes of graphs, solving all but one of the Burr-Erdos problems.
Given any graph $H$, a graph $G$ is said to be $q$-Ramsey for $H$ if every coloring of the edges of $G$ with $q$ colors yields a monochromatic subgraph isomorphic to $H$. Further, such a graph $G$ is said to be minimal $q$-Ramsey for $H$ if additionally no proper subgraph $G'$ of $G$ is $q$-Ramsey for $H$. In 1976, Burr, Erdős, and Lovász initiated the study of the parameter $s_q(H)$, defined as the smallest minimum degree among all minimal $q$-Ramsey graphs for $H$. In this paper, we consider the problem of determining how many vertices of degree $s_q(H)$ a minimal $q$-Ramsey graph for $H$ ca…
The size-Ramsey number of a graph $G$ is the minimum number of edges in a graph $H$ such that every 2-edge-coloring of $H$ yields a monochromatic copy of $G$. Size-Ramsey numbers of graphs have been studied for almost 40 years with particular focus on the case of trees and bounded degree graphs. We initiate the study of size-Ramsey numbers for $k$-uniform hypergraphs. Analogous to the graph case, we consider the size-Ramsey number of cliques, paths, trees, and bounded degree hypergraphs. Our results suggest that size-Ramsey numbers for hypergraphs are extremely difficult to determine, and many…
A graph $G$ is semilinear of complexity $t$ if the vertices of $G$ are elements of $\mathbb{R}^{d}$ for some $d\in\mathbb{Z}^{+}$, and the edges of $G$ are defined by the sign patterns of $t$ linear functions $f_1,\dots,f_t:\mathbb{R}^{d}\times \mathbb{R}^{d}\rightarrow\mathbb{R}$. We show that semilinear graphs of constant complexity have very tame Ramsey properties. More precisely, we prove that if $G$ is a semilinear graph of complexity $t$ which contains no clique of size $s$ and no independent set of size $n$, then $G$ has at most $O_{s,t}(n)\cdot(\log n)^{O_t(1)}$ vertices. We also show …
One of the central questions in Ramsey theory asks how small can be the size of the largest clique and independent set in a graph on $N$ vertices. By the celebrated result of Erdős from 1947, the random graph on $N$ vertices with edge probability $1/2$, contains no clique or independent set larger than $2\log_2 N$, with high probability. Finding explicit constructions of graphs with similar Ramsey-type properties is a famous open problem. A natural approach is to construct such graphs using algebraic tools. Say that an $r$-uniform hypergraph $\mathcal{H}$ is \emph{algebraic of complexity $(n,d…
An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in fact all Ramsey graphs must obey certain "richness" properties characteristic of random graphs. Motivated by an old problem of Erdős and McKay, recently Narayanan, Sahasrabudhe and Tomon conjectured that for any fixed C, every n-vertex C-Ramsey graph induces subgraphs of $Θ(n^2)$ different sizes. In this paper we prove this conjecture.
For a given graph $H$, the anti-Ramsey number of $H$ is the maximum number of colors in an edge-coloring of a complete graph which does not contain a rainbow copy of $H$. In this paper, we extend the decomposition family of graphs to the decomposition family sequence of graphs and show that $K_5$ is determined by its decomposition family sequence. Based on this new graph notation, we determine the anti-Ramsey numbers for new families of graphs, including the Petersen graph, vertex-disjoint union of cliques, etc., and characterize the extremal colorings.
Given an acyclic oriented graph $\vec{H}$ and a graph $G$, we write $G \to \vec{H}$ if every orientation of $G$ has an oriented copy of $\vec{H}$. We define $\vec{R}(\vec{H})$ as the smallest number $n$ such that there exists a graph $G$ satisfying $G \to \vec{H}$. Denoting by $R(H)$ the classical Ramsey number of a graph $H$, we show that $\vec{R}(\vec{H}) \leq 2R(H)^{c \log^2 h}$ for every acyclic oriented graph $\vec{H}$ with $h$ vertices, where $H$ is its underlying undirected graph. We also study the threshold function for the event $\{G(n,p) \to \vec{H}\}$ in the binomial random graph $G…
The Ramsey number $r(C_{\ell},K_n)$ is the smallest natural number $N$ such that every red/blue edge-colouring of a clique of order $N$ contains a red cycle of length $\ell$ or a blue clique of order $n$. In 1978, Erdős, Faudree, Rousseau and Schelp conjectured that $r(C_{\ell},K_n) = (\ell-1)(n-1)+1$ for $\ell \geq n\geq 3$ provided $(\ell,n) \neq (3,3)$. We prove that, for some absolute constant $C\ge 1$, we have $r(C_{\ell},K_n) = (\ell-1)(n-1)+1$ provided $\ell \geq C\frac {\log n}{\log \log n}$. Up to the value of $C$ this is tight since we also show that, for any $\varepsilon >0$ and $n>…
A graph on $n$ vertices is said to be \emph{$C$-Ramsey} if every clique or independent set of the graph has size at most $C \log n$. The only known constructions of Ramsey graphs are probabilistic in nature, and it is generally believed that such graphs possess many of the same properties as dense random graphs. Here, we demonstrate one such property: for any fixed $C>0$, every $C$-Ramsey graph on $n$ vertices induces subgraphs of at least $n^{2-o(1)}$ distinct sizes. This near-optimal result is closely related to two unresolved conjectures, the first due to Erdős and McKay and the second due …
An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in fact all Ramsey graphs must obey certain "richness" properties characteristic of random graphs. More than 25 years ago, Erdős, Faudree and Sós conjectured that in any C-Ramsey graph there are $Ω\left(n^{5/2}\right)$ induced subgraphs, no pair of which have the same numbers of vertices and edges. Improving on earlier results of Alon, Balogh, Kostochka and Samo…
We say that a graph $G$ has the Ramsey property w.r.t.\ some graph $F$ and some integer $r\geq 2$, or $G$ is $(F,r)$-Ramsey for short, if any $r$-coloring of the edges of $G$ contains a monochromatic copy of $F$. R{ö}dl and Ruci{ń}ski asked how globally sparse $(F,r)$-Ramsey graphs $G$ can possibly be, where the density of $G$ is measured by the subgraph $H\subseteq G$ with the highest average degree. So far, this so-called Ramsey density is known only for cliques and some trivial graphs $F$. In this work we determine the Ramsey density up to some small error terms for several cases when $F$ i…
The $k$-th $p$-power of a graph $G$ is the graph on the vertex set $V(G)^k$, where two $k$-tuples are adjacent iff the number of their coordinates which are adjacent in $G$ is not congruent to 0 modulo $p$. The clique number of powers of $G$ is poly-logarithmic in the number of vertices, thus graphs with small independence numbers in their $p$-powers do not contain large homogenous subsets. We provide algebraic upper bounds for the asymptotic behavior of independence numbers of such powers, settling a conjecture of Alon and Lubetzky up to a factor of 2. For precise bounds on some graphs, we ap…
The Erdős-Gyárfás number $f(n, p, q)$ is the smallest number of colors needed to color the edges of the complete graph $K_n$ so that all of its $p$-clique spans at least $q$ colors. In this paper we improve the best known upper bound on $f(n, p, q)$ for many fixed values of $p, q$ and large $n$. Our proof uses a randomized coloring process, which we analyze using the so-called differential equation method to establish dynamic concentration.
Analogues of Ramsey's Theorem for infinite structures such as the rationals or the Rado graph have been known for some time. In this context, one looks for optimal bounds, called degrees, for the number of colors in an isomorphic substructure rather than one color, as that is often impossible. Such theorems for Henson graphs however remained elusive, due to lack of techniques for handling forbidden cliques. Building on the author's recent result for the triangle-free Henson graph, we prove that for each $k\ge 4$, the $k$-clique-free Henson graph has finite big Ramsey degrees, the appropriate a…
