A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
the book Bm is the join K2 ∨ K c m , Wn denotes a wheel with n spokes, and Cn denotes a cycle of length n. ... In this paper we determine the following Ramsey numbers: (1) r(Bm; Wn) = 2n + 1 for m¿1; n¿5m + 3, (2) r(Bm; K2 ∨ Cn) = 2n + 3 for n¿9 if m = 1 or n¿(m − 1)(16m 3 + 16m 2 − 24m − 10) + 1 if m¿2, where ... For the graph G 1 and G 2 the Ramsey number r(G 1 ; G 2 ) is the least positive integer n such that if K n = R ⊕ B is an arbitrary factorization of the complete graph K n , then either G 1 is a subgraph ...doi:10.1016/s0012-365x(00)00049-2 fatcat:vlgdhr6fcbfgvemqcwtizmi7fy
We do not attempt complete coverage of asymptotic behavior of Ramsey numbers, but concentrate on their specific values. ... or complete without one edge. ... irredundant Ramsey numbers, induced Ramsey numbers, planar Ramsey numbers, bipartite Ramsey numbers, on-line Ramsey numbers, mixed Ramsey numbers, local Ramsey numbers, rainbow Ramsey numbers, connected ...doi:10.37236/21 fatcat:xsh3n7wd2fbibgxla3okg5dfxq
The book-complete and book-book Ramsey numbers have been studied extensively, and we direct the reader to the survey [Rad] for related results. ... Two Color Numbers Involving Cycles 2.1 Cycles 2.2 Cycles versus complete graphs 2.3 Cycles versus wheels 2.4 Cycles versus books 2.5 Cycles versus other graphs 3. ...doi:10.1007/978-0-8176-8092-3_3 fatcat:fjjf3qhyknfhbpb4xbqyukbweu
Ramsey and had two children, after her husband's death in 1933, Alice Ramsey, under cover of her married name and her identity as mother, grandmother, and great-grandmother, lived for 50 years with women ... Summering in Asbury Park in 1908 enabled Alice Ramsey to hone her motor skills as she drove 6,000 miles of Monmouth County roads. ... and maintained a studio in New York for a number of years. ...doi:10.14713/njs.v4i2.127 fatcat:ocim25z5j5aljjxdu6yu3giky4
Schelp (1-MEMP; Memphis, TN) 2003m:05131 05C55 Tse, Kung-Kuen (1-KEAN-CS; Union, NJ) On the Ramsey number of the quadrilateral versus the book and the wheel. (English summary) Australas. J. ... Let B, and W,, denote the book graph K> + K,, and the wheel graph K; + C,,_|, respectively. In 1978, R. J. Faudree, C. C. Rousseau and J. ...
Baskoro and Surahmat The Ramsey number of paths with respect to wheels 275 R.C.Brigham, G. Chartrand, R.D. Dutton and P. Zhang P.C.B. Lam, W.C. Shiu and Z.M. ... Nourine The number of Moore families on n ¼ 6 291 W. Qin and Y. Jinjiang 4-regular claw-free IM-extendable graphs 303 B. ...doi:10.1016/s0012-365x(05)00162-7 fatcat:ct2kd5g4yrfljibeafgpswbkmu
, the Ramsey numbers of digraphs which are orientations of a cycle, and the two-dimensional Ramsey numbers of the 2-com- plexes known as books.” ... The list includes the deter- mination of the smallest unresolved diagonal and off-diagonal classical Ramsey numbers, the generalized Ramsey numbers of the smallest non-complete wheels, the determination ...
This raises the possibility that r(C,,, Ke) = 5m —4 for all m > 5.” 2001¢:05088 05C55 Zhou, Huai-Lu On book-wheel Ramsey number. (English summary) Discrete Math. 224 (2000), no. 1-3, 239-249. ... — 24m — 10) +1 if m > 2, where the book B,, is the join K2 V K*,, W,, denotes a wheel with n spokes, and C,, denotes a cycle of length n.” 2001¢:05089 05C60 Zmazek, Blaz (SV-MARPD; Maribor); Zerovnik, ...
Chapter 8: Extremal and Ramsey Properties Chapter 9: Random Regular Graphs Chapter 10: Zero-One Laws References Index of Notation Index Table of Contents of Normal" Structures in Metric Spaces ... Vertex-magic total labelings of wheels 3.5. Vertex-magic total labelings of complete bipartite graphs 3.6. Graphs with vertices of degree one 3.7. The complete graphs 3.8. Disconnected graphs 3.9. ...doi:10.1016/s0012-365x(03)00015-3 fatcat:5gpkz5qt45ea5i6uzaflcaxroa
The Beaded wheel BW m is a graph on 2m +1 vertices which is obtained by inserting one vertex in each spoke of the wheel W m . Theorem 14 (Ali et al. ... We remark here that the Ramsey numbers of paths versus stars and paths versus (generalized) books under the condition of Corollary 4 was already obtained by Parsons  , and Rousseau and Sheehan [14 ...doi:10.1007/s00373-016-1721-z fatcat:5pmzsmvqd5fb5dvdtntnzmkl7i
Morals Not Knowledge
Harvard University (2008); the "Religion Working Group, " Department of Sociology, University of California, Los Angeles (2009); the "Religious Responses to Darwinism, 1859-2009" conference at the Ian Ramsey ... on "Religion, Naturalism and the Sciences" at Florida State University (2013); the conference on "Science & Religion: Exploring the Spectrum, " at York University, Toronto, Canada (2015); the conference ... Now that I have tried to synthesize all of the earlier partial attempts into one book, my perspective has changed a bit. Themes from these earlier articles survive in this book. ...doi:10.1525/9780520969780-001 fatcat:mqreyzclafeblcdr5jtliptzui
The Banking Law Journal
The Ramsey Swinging Pedals are justly called the Pullman Cars of Cycling, and no wheel is up to-date withou: them. ... They settle just such disputes, for in- stance, as the one published in June number at page 363. See advertisement in this number of Frank Wittenberg, Little Rock, Ark. ...
The Reliquary and Illustrated Archaeologist
124 NOTES ON BOOKS, MUSIC, ETC. ... Parts I. and II. not having reached us, we can scarcely be expected to speak so fully of the publication from this odd number as if we had the previous ones before us. ...
number of a book B m = K 2 * K c m versus a cycle C n of order n satisfies R(B m , C n ) = 2n − 1 for n > (6m + 7)/4 which improves a result of Faudree et al., and the Ramsey number of a cycle C n versus ... As consequences, Ramsey numbers of other sparse graphs are also obtained. ... The following lower bound on Ramsey numbers is well known in graph Ramsey theory. ...doi:10.1016/j.ejc.2009.07.004 fatcat:fzdomgcvebazzgkeqenfufm3fy
For proofs we mostly get references to other papers, in particu- lar, one by A. Medrano et al. [J. Comput. Appl. Math. 68 (1996), no. 1-2, 221-238; MR 97k:11172], and a book by A. A. ... Summary: “Classical Ramsey numbers r = r;(G) ask for the small- est number r such that every t-coloring of the edges of the com- plete graph K, contains a monochromatic copy of a given graph G. ...
« Previous Showing results 1 — 15 out of 1,854 results