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: | Joanna Cyman, Tomasz Dzido |
---|---|
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 |
Similar Items
-
On the restricted size Ramsey number for P3 versus dense connected graphs
by: Denny Riama Silaban, et al.
Published: (2020-10-01) -
Restricted size Ramsey number for path of order three versus graph of order five
by: Denny Riama Silaban, et al.
Published: (2017-04-01) -
On size multipartite Ramsey numbers for stars versus paths and cycles
by: Anie Lusiani, et al.
Published: (2017-04-01) -
A Note on On-Line Ramsey Numbers for Some Paths
by: Tomasz Dzido, et al.
Published: (2021-03-01) -
A note on the size Ramsey numbers for matchings versus cycles
by: Edy Tri Baskoro, et al.
Published: (2021-07-01)