2017
DOI: 10.22457/apam.v13n1a2
|View full text |Cite
|
Sign up to set email alerts
|

Size Multipartite Ramsey Numbers for K4-e Versus all Graphs up to 4 Vertices

Abstract: Let G and H be two simple subgraphs of s j K ×. The smallest positive integer s such that any red and blue colouring of s j K × has a copy of red G or a blue H is called the multipartite Ramsey number of G and H. It is denoted by) , (H G m j. This paper presents exact values for) , (2 G B m j where G is a isolate vertex free graph up to four vertices.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(11 citation statements)
references
References 3 publications
0
9
0
Order By: Relevance
“…that H R contains no red P 4 and H B contains no blue K 1 , 3 . As H B contains no blue K 1 , 3 both v 1,1 , v 1,2 will satisfy deg R (v 1,1 ) ≥ 4 and deg R (v 1,2 ) ≥ 4.…”
Section: Theorem 21 If J ≥ 3 Thenmentioning
confidence: 96%
See 2 more Smart Citations
“…that H R contains no red P 4 and H B contains no blue K 1 , 3 . As H B contains no blue K 1 , 3 both v 1,1 , v 1,2 will satisfy deg R (v 1,1 ) ≥ 4 and deg R (v 1,2 ) ≥ 4.…”
Section: Theorem 21 If J ≥ 3 Thenmentioning
confidence: 96%
“…But as m 3 (P 3 ,C 3 ) = 2 we get that there exists red P 3 with end points x and y. Let z and w be two points not in this red P 3 and not belonging to the partite sets x, y belong to. But then as H R contains no red P 4 , we will obtain that x, z, y, w, x is a blue C 4 , a contradiction.…”
Section: Theorem 21 If J ≥ 3 Thenmentioning
confidence: 97%
See 1 more Smart Citation
“…In order to show, m 5 As there is no blue C 4 , (v 2,2 ,v 3,1 ) and (v 4,2 ,v 2,1 ) have to be red edges. Next as there is no red C 4 , (v 2,2 ,v 4,1 ) has to be a blue edge.…”
Section: Some Useful Lemmas On Connected Proper Subgraphs Ofmentioning
confidence: 99%
“…In the last four decades most of the Ramsey numbers R(H,K) have been studied in detail for |V (H)| <7 and |V (K)| <7 (see [6]). The size Ramsey multipartite number m j (H,K) is defined as the smallest natural number t such that K j×t → (H,K) (see [1,3,5,7]). In this paper we concentrate on determining multipartite Ramsey numbers m j (C 4 ,G) for all possible proper subgraphs G of K 4 .…”
Section: Introductionmentioning
confidence: 99%