scholarly journals The Ramsey Numbers for Star Versus Wheel of Even Order

2018 ◽  
Vol 979 ◽  
pp. 012073
Author(s):  
Hasmawati ◽  
P Nur Rohmah Oktaviani ◽  
Loeky Haryanto
Keyword(s):  
Ramsey Numbers ◽  
Even Order ◽  
Star Versus

Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp

2012 ◽  
Vol 21 (1-2) ◽  
pp. 179-186 ◽  
Author(s):  
ANDRÁS GYÁRFÁS ◽  
GÁBOR N. SÁRKÖZY
Keyword(s):  
Minimum Degree ◽  
Ramsey Number ◽  
Regularity Lemma ◽  
Ramsey Numbers ◽  
Standard Application ◽  
Star Versus ◽  
Ramsey Type ◽  
Weakened Form

R. H. Schelp conjectured that if G is a graph with |V(G)| = R(Pn, Pn) such that δ(G) > $$\frac{3|V(G)|}{ 4}$, then in every 2-colouring of the edges of G there is a monochromatic Pn. In other words, the Ramsey number of a path does not change if the graph to be coloured is not complete but has large minimum degree.Here we prove Ramsey-type results that imply the conjecture in a weakened form, first replacing the path by a matching, showing that the star-matching–matching Ramsey number satisfying R(Sn, nK2, nK2) = 3n − 1. This extends R(nK2, nK2) = 3n − 1, an old result of Cockayne and Lorimer. Then we extend this further from matchings to connected matchings, and outline how this implies Schelp's conjecture in an asymptotic sense through a standard application of the Regularity Lemma.It is sad that we are unable to hear Dick Schelp's reaction to our work generated by his conjecture.

scholarly journals Batas Bawah Bilangan Ramsey pada Graf Bintang S_10 Versus Roda W_12 Lower Bound of the Ramsey Number for the Star Graph S_10 Versus Wheels W_12

2018 ◽  
Vol 3 (1) ◽  
pp. 471
Author(s):  
Hamdana Hadaming ◽  
Andi Ardhila Wahyudi
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Lower Boundary ◽  
Ramsey Number ◽  
Star Graph ◽  
Point Graph ◽  
Ramsey Numbers ◽  
Critical Graph ◽  
Star Versus

Bilangan Ramsey untuk graf  terhadap graf , dinotasikan dengan  adalah bilangan bulat terkecil  sedemikian sehingga untuk setiap graf  dengan orde akan memenuhi sifat berikut:  memuat graf  atau komplemen dari  memuat graf .Penelitian ini bertujuan untuk  menentukan graf kritis maksimum  dan  dengan genap. Berdasarkan batas bawah tersebut di tentukan batas atas minimum sehingga diperoleh nilai bilangan Ramsey untuk graf bintang  versus , atau . Dengan demikian penentuan batas bawah bilangan Ramsey  dilakukan dengan cara batas bawah yang  diberikan oleh Chavatal dan Harary, untuk bilangan Ramsey pada graf bintang  versus  adalah , dengan  adalah bilangan kromatik titik graf roda  dan  adalah kardinalitas komponen terbesar graf . Berdasarkan batas bawah Chavatal dan Harary tersebut dikonstruksi graf kritis untuk  dan  yang ordenya lebih besar dari nilai batas bawah yang diberikan Chavatal dan Harary. Orde dari graf kritis tersebut merupakan batas bawah terbaik untuk . Kata kunci: Bilangan Ramsey, bintang, roda AbstractRamsey Numbers for a graph  to a graph , denoted by   is the smallest integer n such that for every graph  of order  either  the following meeet:  contains a graph  or the complement of  contains the graph . This aims of the study to determine the maximum critical graph  and . Based on the lower bound of the specified minimum upper bound in order to obtain numerical values for the Ramsey graph  Star versus  , or . Thus the determination of Ramsey numbers .  is done by determine the lower boundary and upper bound. The lower bound given by Chavatal and Harary, for ramsey number for star graph versus wheel   is , is a point graph of chromatic number wheel  and  is the cardinality of the largest component of the graph . Based on the lower bound Chavatal and Harary graph is constructed critical to  and  are poin greater than the lower bound value given Chavatal and Harary. Order of the critical graph is the best lower bound for . Keywords : Ramsey number, Stars, and Wheels

scholarly journals The Ramsey numbers for stars of even order versus a wheel of order nine

2008 ◽  
Vol 29 (7) ◽  
pp. 1744-1754 ◽  
Author(s):  
Yunqing Zhang ◽  
Yaojun Chen ◽  
Kemin Zhang
Keyword(s):  
Ramsey Numbers ◽  
Even Order

scholarly journals The Ramsey numbers for cycles versus wheels of even order

2010 ◽  
Vol 31 (1) ◽  
pp. 254-259 ◽  
Author(s):  
Lianmin Zhang ◽  
Yaojun Chen ◽  
T.C. Edwin Cheng
Keyword(s):  
Ramsey Numbers ◽  
Even Order

A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers

10.37236/1188 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Geoffrey Exoo
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Ramsey Numbers

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.

scholarly journals Edge-ordered Ramsey numbers

2020 ◽  
Vol 87 ◽  
pp. 103100
Author(s):  
Martin Balko ◽  
Máté Vizer
Keyword(s):  
Ramsey Numbers

scholarly journals A Note on On-Line Ramsey Numbers for Some Paths

Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 735
Author(s):  
Tomasz Dzido ◽  
Renata Zakrzewska
Keyword(s):  
Ramsey Number ◽  
Ramsey Numbers ◽  
Minimum Number ◽  
On Line ◽  
Infinite Set ◽  
Do So

We consider the important generalisation of Ramsey numbers, namely on-line Ramsey numbers. It is easiest to understand them by considering a game between two players, a Builder and Painter, on an infinite set of vertices. In each round, the Builder joins two non-adjacent vertices with an edge, and the Painter colors the edge red or blue. An on-line Ramsey number r˜(G,H) is the minimum number of rounds it takes the Builder to force the Painter to create a red copy of graph G or a blue copy of graph H, assuming that both the Builder and Painter play perfectly. The Painter’s goal is to resist to do so for as long as possible. In this paper, we consider the case where G is a path P4 and H is a path P10 or P11.

scholarly journals Existence of Multiple Positive Solutions for Even Order Multi-Point Boundary Value Problems

2007 ◽  
Vol 14 (4) ◽  
pp. 775-792
Author(s):  
Youyu Wang ◽  
Weigao Ge
Keyword(s):  
Fixed Point ◽  
Fixed Point Theorem ◽  
Boundary Value Problem ◽  
Boundary Value Problems ◽  
Positive Solutions ◽  
Boundary Value ◽  
Sufficient Conditions ◽  
Multiple Positive Solutions ◽  
Point Boundary ◽  
Even Order

Abstract In this paper, we consider the existence of multiple positive solutions for the 2𝑛th order 𝑚-point boundary value problem: where (0,1), 0 < ξ 1 < ξ 2 < ⋯ < ξ 𝑚–2 < 1. Using the Leggett–Williams fixed point theorem, we provide sufficient conditions for the existence of at least three positive solutions to the above boundary value problem. The associated Green's function for the above problem is also given.

Sign in / Sign up

Export Citation Format

Share Document