Sciweavers

60 search results - page 2 / 12
» Path-kipas Ramsey numbers
Sort
View
JGT
2010
103views more  JGT 2010»
13 years 4 months ago
Proof of a conjecture on fractional Ramsey numbers
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
Jason Brown, Richard Hoshino
DM
2000
158views more  DM 2000»
13 years 5 months ago
Bipartite Ramsey numbers and Zarankiewicz numbers
The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the lea...
Wayne Goddard, Michael A. Henning, Ortrud R. Oelle...
DM
2002
101views more  DM 2002»
13 years 5 months ago
On generalized Ramsey numbers
Let f1 and f2 be graph parameters. The Ramsey number r(f1 m; f2 n) is defined as the minimum integer N such that any graph G on N vertices, either f1(G) m or f2(G) n. A genera...
Wai Chee Shiu, Peter Che Bor Lam, Yusheng Li
JCT
2008
92views more  JCT 2008»
13 years 5 months ago
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
Chv
Oliver Cooley, Nikolaos Fountoulakis, Daniela K&uu...
DM
1998
118views more  DM 1998»
13 years 5 months ago
Chromatic Ramsey numbers
Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: For any...
Xuding Zhu