A345443 - OEIS

A345443

a(n) = smallest m such that for every red-blue edge-coloring of the graph K_{m,m} there exists either a red 4-cycle or a blue K_{1,n}.

2, 4, 5, 6, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, 22, 22, 24, 25, 26, 27, 28, 29, 30, 32, 32

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

REFERENCES

Hatala, Imre, Tamás Héger, and Sam Mattheus. "New values for the bipartite Ramsey number of the four-cycle versus stars." Discrete Mathematics 344.5 (2021): 112320. Page 13 gives the known values for n <= 240.

LINKS

Table of n, a(n) for n=1..27.

Index entries for sequences related to Ramsey numbers

CROSSREFS

Sequence in context: A039242 A039185 A080240 * A135668 A276216 A226946

Adjacent sequences: A345440 A345441 A345442 * A345444 A345445 A345446

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Jun 30 2021

STATUS

approved