On the restricted size Ramsey number for P3 versus dense connected graphs

On the restricted size Ramsey number for P3 versus dense connected graphs

<p>Let <em>F</em>, <em>G</em> and <em>H</em> be simple graphs. A graph <em>F</em> is said a (<em>G,H</em>)-arrowing graph if in any red-blue coloring of edges of <em>F </em>we can find a red <em>G</em> or a blu...

Full description

Bibliographic Details
Main Authors: Denny Riama Silaban, Edy Tri Baskoro, Saladin Uttunggadewa
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2020-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
restricted size ramsey number, size ramsey number, dense connected graph, path
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/1053

Internet

https://www.ejgta.org/index.php/ejgta/article/view/1053

Similar Items