On Size Multipartite Ramsey Numbers for Stars versus Cycles | Zendy

Anie Lusiani | Zendy; Syafrizal Sy | Zendy; Edy Tri Baskoro | Zendy; Chula J. Jayawardene | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On Size Multipartite Ramsey Numbers for Stars versus Cycles

Author(s) -

Anie Lusiani,

Syafrizal Sy,

Edy Tri Baskoro,

Chula J. Jayawardene

Publication year - 2015

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2015.12.070

Subject(s) - multipartite , combinatorics , ramsey's theorem , integer (computer science) , graph , factorization , mathematics , discrete mathematics , stars , computer science , algorithm , physics , quantum mechanics , quantum entanglement , quantum , programming language , computer vision

For given two graphs G1 and G2, and integer j ≥ 2, the size multipartite Ramsey numbers mj(G1, G2) is the smallest integer t such that every factorization of the graph Kj×t := F1 ⊕ F2 satisfies the following condition: either F1 contains G1 or F2 contains G2. In this paper, we determine mj(S m, Cn) for j, m, n ≥ 3 where S m is a star on m vertices and Cn is a cycle on n vertices

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research