Affordable Access

Publisher Website

Star sub-Ramsey numbers

Authors
Identifiers
DOI: 10.1016/s0304-0208(08)72883-4

Abstract

Abstract Let sr(G, k) be the least m such that in any colouring of the edges of Km using no colour more than k times there is a (isomorphic copy of) G with all edges of distinct colours. Continuing previous work of one of the authors we determine good bounds on sr (K1,s, k) and use them to find exact values for large classes of parameters.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

More star sub-ramsey numbers

on Discrete Mathematics Jan 01, 1981

Some tree-star Ramsey Numbers

on Journal of Combinatorial Theor... Jan 01, 1974

Path-Star Ramsey numbers

on Journal of Combinatorial Theor... Jan 01, 1974
More articles like this..