On induced Ramsey numbers

@article{Gorgol2002OnIR,
  title={On induced Ramsey numbers},
  author={Izolda Gorgol and Tomasz Luczak},
  journal={Discrete Mathematics},
  year={2002},
  volume={251},
  pages={87-96}
}
The induced Ramsey number IR(G,H) is defined as the smallest integer n, for which there exists a graph F on n vertices such that any 2-colouring of its edges with red and blue leads to either a red copy of G induced in F, or an induced blue H. In this note, we study the value of the induced Ramsey numbers, as well as their planar and weak versions, for some special classes of graphs. In particular, we show that, for the induced planar Ramsey numbers, the fact whether we prohibit monochromatic… CONTINUE READING

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-7 OF 7 CITATIONS

Ju n 20 07 Induced Ramsey-type theorems

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Induced Ramsey-type theorems

  • Electronic Notes in Discrete Mathematics
  • 2007
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

On lower bound for induced Ramsey numbers

  • Discussiones Mathematicae Graph Theory
  • 2017
VIEW 3 EXCERPTS
CITES BACKGROUND

Avoiding rainbow induced subgraphs in edge-colorings

  • Australasian J. Combinatorics
  • 2009
VIEW 1 EXCERPT
CITES BACKGROUND

Planar Ramsey Numbers

  • Discussiones Mathematicae Graph Theory
  • 2005
VIEW 1 EXCERPT

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

Planar Ramsey Numbers

  • J. Comb. Theory, Ser. B
  • 1993
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

The analog of Ramsey numbers for planar graphs

K. Walker
  • Bull. London Math. Soc. 1
  • 1969
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

PrB omel, V

H.J.Y. Kohayakawa
  • RB odl, Induced Ramsey numbers,
  • 1998

V

T. Luczak
  • RB odl, On induced Ramsey numbers for graphs with bounded maximum degree, J. Combin. Theory Ser. B 66
  • 1996

Induced Ramsey numbers

H. J. PrBomel Y. Kohayakawa, V. RBodl
  • Combinatorica
  • 1995

L

P. Erdős, A. Hajnal
  • PT osa, Strong embeddings of graphs into colored graphs, in: R. Rado, A. Hajnal, V. ST os (Eds.), In1nite and Finite Sets Vol. 10, North-Holland, Amsterdam
  • 1975
VIEW 1 EXCERPT