11,474 research outputs found
On some three color Ramsey numbers for paths, cycles, stripes and stars
For given graphs , the multicolor Ramsey
number is the smallest integer such that if
we arbitrarily color the edges of the complete graph of order with
colors, then it always contains a monochromatic copy of colored with
, for some . The bipartite Ramsey number is the least positive integer such that any coloring of the edges of
with colors will result in a monochromatic copy of bipartite
in the -th color, for some , .
There is very little known about even for very
special graphs, there are a lot of open cases. In this paper, by using
bipartite Ramsey numbers we obtain the exact values of some multicolor Ramsey
numbers. We show that for sufficiently large and three following cases:
1. , and ,
2. ,
3. , and , we have
We prove that for large . In addition, we
prove that for even , . For
and , we obtain that where
is a path on vertices and is a matching of size .
We also provide some new exact values or generalize known results for other
multicolor Ramsey numbers of paths, cycles, stripes and stars versus other
graphs
Ramsey numbers of trees versus odd cycles
Burr, Erd\H{o}s, Faudree, Rousseau and Schelp initiated the study of Ramsey
numbers of trees versus odd cycles, proving that for all
odd and , where is a tree with vertices
and is an odd cycle of length . They proposed to study the minimum
positive integer such that this result holds for all ,
as a function of . In this paper, we show that is at most linear.
In particular, we prove that for all odd and
. Combining this with a result of Faudree, Lawrence, Parsons and
Schelp yields is bounded between two linear functions, thus
identifying up to a constant factor.Comment: 10 pages, updated to match EJC versio
A survey of hypergraph Ramsey problems
The classical hypergraph Ramsey number is the minimum such
that for every red-blue coloring of the -tuples of , there
are integers such that every -tuple among them is red, or integers
such that every -tuple among them is blue. We survey a variety of problems
and results in hypergraph Ramsey theory that have grown out of understanding
the quantitative aspects of . Our focus is on recent developments and
open problems
Restricted size Ramsey number for versus cycles
Let , and be simple graphs. We say if for
every -coloring of the edges of there exists a monochromatic or
in . The Ramsey number is defined as , while the restricted size Ramsey number is
defined as . In this paper we determine previously unknown restricted size Ramsey
numbers for . We also give new upper bound
for even
Trees and -Good Hypergraphs
Trees fill many extremal roles in graph theory, being minimally connected and
serving a critical role in the definition of -good graphs. In this article,
we consider the generalization of trees to the setting of -uniform
hypergraphs and how one may extend the notion of -good graphs to this
setting. We prove numerous bounds for -uniform hypergraph Ramsey numbers
involving trees and complete hypergraphs and show that in the -uniform case,
all trees are -good when is odd or falls into specified even cases.Comment: 23 pages, 3 figures, 2 table
On the size Ramsey number of all cycles versus a path
We say if contains an -vertex path
for any spanning forest . The size Ramsey number
is the smallest integer such that there exists
a graph with edges for which . Dudek, Khoeini
and Pra{\l}at proved that for sufficiently large , . In this note, we improve both the lower and
upper bounds to Our
construction for the upper bound is completely different than the one
considered by Dudek, Khoeini and Pra{\l}at. We also have a computer assisted
proof of the upper bound .Comment: 13 pages, 3 figure
A Note on Lower Bounds for Induced Ramsey Numbers
We say that a graph strongly arrows a pair of graphs if any
2-colouring of its edges with red and blue leads to either a red or a blue
appearing as induced subgraphs of . The induced Ramsey number,
is defined as the minimum number of vertices of a graph which strongly
arrows a pair . We will consider two aspects of induced Ramsey numbers.
Firstly there will be shown that the lower bound of the induced Ramsey number
for a connected graph with independence number and a graph
with clique number roughly . This bounds is
sharp. Moreover we discuss also the case when is not connected providing
also a sharp lower bound which is linear in both parameter
Ramsey goodness of cycles
Given a pair of graphs and , the Ramsey number is the
smallest such that every red-blue coloring of the edges of the complete
graph contains a red copy of or a blue copy of . If a graph is
connected, it is well known and easy to show that , where is the chromatic number of
and is the size of the smallest color class in a -coloring
of . A graph is called -good if . The notion of Ramsey goodness was introduced by
Burr and Erd\H{o}s in 1983 and has been extensively studied since then.
In this paper we show that if and then the -vertex cycle is -good. For graphs with
high and , this proves in a strong form a conjecture of
Allen, Brightwell, and Skokan
On star-wheel Ramsey numbers
For two given graphs and , the Ramsey number is the
least integer such that for every graph on vertices, either
contains a or contains a . In this note, we determined the
Ramsey number for even with , where
is the wheel on vertices, i.e., the graph obtained from a cycle
by adding a vertex adjacent to all vertices of the .Comment: 8 page
The Ramsey number of loose cycles versus cliques
Recently Kostochka, Mubayi and Verstra\"ete initiated the study of the Ramsey
numbers of uniform loose cycles versus cliques. In particular they proved that
for all fixed . For the
case of loose cycles of length five they proved that
and conjectured that for all fixed . Our main result is that and more generally for any fixed that .
We also explain why for every fixed , , if is odd, which improves upon the result
of Collier-Cartaino, Graber and Jiang who proved that for every fixed , , we have .Comment: 18 page
- …