the zarankiewicz number z(b; s) is the maximum size of a subgraph of kb,b which does not contain ks,s as a subgraph. the two-color bipartite ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of kb,b with two colors contains a ks,s in the rst color or a kt,t in the second color.in this work, we design and exploit a computational method for bounding and computin...

Given a graph G and positive integer k, define the Gallai-Ramsey number to be minimum of vertices n such that any k-edge coloring $$K_n$$ contains either rainbow (all different colored) triangle or monochromatic copy G. Much like Ramsey numbers, numbers have gained reputation as being very difficult compute in general. As yet, still only precious few sharp results are known. In this paper, we o...

The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...

A graph $G$ is Ramsey for a $H$ if every colouring of the edges in two colours contains monochromatic copy $H$. Two graphs $H_1$ and $H_2$ are equivalent any only it $H_2$. parameter $s$ distinguishing $s(H_1)\neq s(H_2)$ implies that not equivalent. In this paper we show chromatic number parameter. We also extend to multi-colour case use similar idea find another which distinguishing.