Prefer a chat interface with context about you and your work?
Restricted Size Ramsey Number for 2K2 versus Dense Connected Graphs of Order Six
Let G and H be simple graphs. The Ramsey number r(G, H) for a pair of graphs G and H is the smallest number r such that any red-blue coloring of the edges of Kr contains a red subgraph G or a blue subgraph H. The size Ramsey number for …