Restricted size Ramsey number for P3 versus cycle
Let <em>F</em>, <em>G</em> and <em>H</em> be simple graphs. We say <em>F</em> → (<em>G</em>,<em>H</em>) if for every 2-coloring of the edges of <em>F</em> there exists a red copy of <em>G</em> or a blue c...
| Main Authors: | , |
|---|---|
| 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: | |
| Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/822 |