I. Wayan Sudarsana

Learn More
For graphs G and H, Ramsey number R(G, H) is the minimum n such that in every coloring of the edges of the complete graph K n with two colors, say red and blue, there is a red copy of G or a blue copy of H. A graph F is called (G, H)–free if F contains no subgraph isomorphic to G and its complement F contains no subgraph isomorphic to H. The Ramsey number(More)
  • 1