On globally sparse Ramsey graphs

Details On globally sparse Ramsey graphs On globally sparse Ramsey graphs

2011-08-04

arxiv.org/abs/1108.1102v1

Mathematics

Combinatorics

Scientific paper

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{\"o}dl and Ruci{\'n}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$ is a complete bipartite graph, a cycle or a path, and $r\geq 2$ colors are available.

Affiliated with

Also associated with

No associations

Rating

On globally sparse Ramsey graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On globally sparse Ramsey graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On globally sparse Ramsey graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14589