zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Ramsey numbers for cycles in graphs. (English) Zbl 0248.05127
For two graphs G 1 and G 2 , the Ramsey number R(G 1 ,G 2 ) is the minimum p such that for any graph G of order p, either G 1 is a subgraph of G of G 2 is a subgraph of the complement G ¯ of G. The authors determine the Ramsey numbers in the cases where G 1 and G 2 are certain cycles. [These Ramsey numbers have since been established completely by J. Faudree and R. H. Schelp [Discrete Math. 8, 313-329 (1974; Zbl 0294.05122)] and V. Rosta [J. Comb. Theory, Ser. B 15, 94-104, 105-120 (1973; Zbl 0261.05118 and Zbl 0261.05119)]. The authors show that R(C n ,K r )nr 2 for all r and n and that (R(C n ,K r )=(r-1)(n-1)+1 if nr 2 -2. Let K r t+1 denote the complete (t+1)-partite graph K(r 1 ,...,r t+1 ) for which r i =r for each i. Then R(C n ,K r t+1 )=t(n-1)+r for sufficiently large n.
Reviewer: G.Chartrand

05C35Extremal problems (graph theory)
05C15Coloring of graphs and hypergraphs