The connected size Ramsey number for matchings versus small disconnected graphs

The connected size Ramsey number for matchings versus small disconnected graphs

<p>Let <span class="math"><em>F</em>, <em>G</em>, </span> and <span class="math"><em>H</em></span> be simple graphs. The notation <span class="math"><em>F</em> → (<em>G</em>,...

Full description

Bibliographic Details
Main Authors: Hilda Assiyatun, Budi Rahadjeng, Edy Tri Baskoro
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 2019-04-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
connected size ramsey number, disconnected graph, matching
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/562

Internet

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

Similar Items