99,631 research outputs found
Three-colour bipartite Ramsey number for graphs with small bandwidth
We estimate the -colour bipartite Ramsey number for balanced bipartite
graphs with small bandwidth and bounded maximum degree. More precisely, we
show that the minimum value of such that in any -edge colouring of
there is a monochromatic copy of is at most
. In particular, we determine asymptotically the
-colour bipartite Ramsey number for balanced grid graphs.Comment: 15 page
Ramsey numbers of uniform loose paths and cycles
Recently, determining the Ramsey numbers of loose paths and cycles in uniform
hypergraphs has received considerable attention. It has been shown that the
-color Ramsey number of a -uniform loose cycle ,
, is asymptotically .
Here we conjecture that for any and
Recently the case is proved by the authors. In this paper, first we show
that this conjecture is true for with a much shorter proof. Then, we show
that for fixed and the conjecture is equivalent to (only)
the last equality for any . Consequently, the proof for
follows
Ramsey numbers of 3-uniform loose paths and loose cycles
Haxell et. al. [%P. Haxell, T. Luczak, Y. Peng, V. R\"{o}dl, A.
%Ruci\'{n}ski, M. Simonovits, J. Skokan, The Ramsey number for hypergraph
cycles I, J. Combin. Theory, Ser. A, 113 (2006), 67-83] proved that the 2-color
Ramsey number of 3-uniform loose cycles on vertices is asymptotically
. Their proof is based on the method of Regularity Lemma. Here,
without using this method, we generalize their result by determining the exact
values of 2-color Ramsey numbers involving loose paths and cycles in 3-uniform
hypergraphs. More precisely, we prove that for every ,
and for ,
. These give
a positive answer to a question of Gy\'{a}rf\'{a}s and Raeisi [The Ramsey
number of loose triangles and quadrangles in hypergraphs, Electron. J. Combin.
19 (2012), #R30]
The Size-Ramsey Number of 3-uniform Tight Paths
Given a hypergraph H, the size-Ramsey number Λr2(H) is the smallest integer m such that there exists a hypergraph G with m edges with the property that in any colouring of the edges of G with two colours there is a monochromatic copy of H. We prove that the size-Ramsey number of the 3-uniform tight path on n vertices Pn(3) is linear in n, i.e., Λr2(Pn(3)) = O(n). This answers a question by Dudek, La Fleur, Mubayi, and RΓΆdl for 3-uniform hypergraphs [On the size-Ramsey number of hypergraphs, J. Graph Theory 86 (2016), 417β434], who proved Λr2(Pn(3)) = O(n3/2 log3/2 n)
Hypergraph Ramsey numbers of cliques versus stars
Let denote the complete -uniform hypergraph on vertices
and the -uniform hypergraph on vertices consisting of all
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 exhibits an
unusual intermediate growth rate, namely, for some positive
constants and . The proof of these bounds brings in a novel Ramsey
problem on grid graphs which may be of independent interest: what is the
minimum such that any -edge-coloring of the Cartesian product contains either a red rectangle or a blue ?Comment: 13 page
Tur\'an's problem and Ramsey numbers for trees
Let and be the trees on vertices with
,
, and
. In this
paper, for we obtain explicit formulas for \ex(p;T_n^1) and
\ex(p;T_n^2), where \ex(p;L) denotes the maximal number of edges in a graph
of order not containing as a subgraph. Let r(G\sb 1, G\sb 2) be the
Ramsey number of the two graphs and . In this paper we also obtain
some explicit formulas for , where and is a
tree on vertices with .Comment: 21 page
Improved bounds for the Ramsey number of tight cycles versus cliques
The 3-uniform tight cycle has vertex set and edge set . We prove that for every (mod 3) and
or there is a such that the 3-uniform
hypergraph Ramsey number This answers in
strong form a question of the author and R\"odl who asked for an upper bound of
the form for each fixed , where as and is sufficiently large. The
result is nearly tight as the lower bound is known to be exponential in
Hypergraph Ramsey numbers
The Ramsey number r_k(s,n) is the minimum N such that every red-blue coloring
of the k-tuples of an N-element set contains either a red set of size s or a
blue set of size n, where a set is called red (blue) if all k-tuples from this
set are red (blue). In this paper we obtain new estimates for several basic
hypergraph Ramsey problems. We give a new upper bound for r_k(s,n) for k \geq 3
and s fixed. In particular, we show that r_3(s,n) \leq 2^{n^{s-2}\log n}, which
improves by a factor of n^{s-2}/ polylog n the exponent of the previous upper
bound of Erdos and Rado from 1952. We also obtain a new lower bound for these
numbers, showing that there are constants c_1,c_2>0 such that r_3(s,n) \geq
2^{c_1 sn \log (n/s)} for all 4 \leq s \leq c_2n. When s is a constant, it
gives the first superexponential lower bound for r_3(s,n), answering an open
question posed by Erdos and Hajnal in 1972. Next, we consider the 3-color
Ramsey number r_3(n,n,n), which is the minimum N such that every 3-coloring of
the triples of an N-element set contains a monochromatic set of size n.
Improving another old result of Erdos and Hajnal, we show that r_3(n,n,n) \geq
2^{n^{c \log n}}. Finally, we make some progress on related hypergraph
Ramsey-type problems
Path-fan Ramsey numbers
For two given graphs and , the Ramsey number is the smallest positive integer such that for every graph on vertices the following holds: either contains as a subgraph or the complement of contains as a subgraph. In this paper, we study the Ramsey numbers , where is a path on vertices and is the graph obtained from disjoint triangles by identifying precisely one vertex of every triangle ( is the join of and ). We determine exact values for for the following values of and : or and ; and ; and or ; and with ; or and ; and . We conjecture that for the other values of and . \u
Three colour bipartite Ramsey number of cycles and paths
The -colour bipartite Ramsey number of a bipartite graph is the least
integer for which every -edge-coloured complete bipartite graph
contains a monochromatic copy of . The study of bipartite Ramsey
numbers was initiated, over 40 years ago, by Faudree and Schelp and,
independently, by Gy\'arf\'as and Lehel, who determined the -colour Ramsey
number of paths. In this paper we determine asymptotically the -colour
bipartite Ramsey number of paths and (even) cycles.Comment: 15 pages, 3 figure
- β¦