Prefer a chat interface with context about you and your work?
On the restricted size Ramsey number for P3 versus dense connected graphs
Let F , G and H be simple graphs. A graph F is said a ( G,H )-arrowing graph if in any red-blue coloring of edges of F we can find a red G or a blue H . The size Ramsey number of G and H , ŕ ( …