146 search results - page 2 / 30 » A Bound for Size Ramsey Numbers of Multi-partite Graphs |
DM
2000
13 years 6 months ago
2000
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...
GC
2011
Springer
13 years 1 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
JCT
2006
13 years 6 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
DAM
2007
13 years 6 months ago
2007
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...
DM
2010
13 years 6 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...