Adam Yusko

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In a red-blue coloring of a nonempty graph, every edge is colored red or blue. If the resulting edge-colored graph contains a nonempty subgraph G without isolated vertices every edge of which is colored the same, then G is said to be monochromatic. For two nonempty graphs G and H without isolated vertices, the mono-chromatic Ramsey number mr(G, H) of G and(More)
  • 1