# 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

#### 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

VIEW 5 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## On induced Ramsey numbers for multiple copies of graphs

VIEW 3 EXCERPTS

CITES BACKGROUND

## On lower bound for induced Ramsey numbers

VIEW 3 EXCERPTS

CITES BACKGROUND

## Avoiding rainbow induced subgraphs in edge-colorings

VIEW 1 EXCERPT

CITES BACKGROUND

## Planar Ramsey Numbers

VIEW 1 EXCERPT

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 11 REFERENCES

## Planar Ramsey Numbers

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## The analog of Ramsey numbers for planar graphs

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## PrB omel, V

## V

## Induced Ramsey numbers

## A generalization of Ramsey's theorem for regular trees

VIEW 2 EXCERPTS

## L

VIEW 1 EXCERPT