Restricted size Ramsey number for path of order three versus graph of order five
Let $G$ and $H$ be simple graphs. The Ramsey number for a pair of graph $G$ and $H$ is the smallest number $r$ such that any red-blue coloring of edges of $K_r$ contains a red subgraph $G$ or a blue subgraph $H$. The size Ramsey number for a pair of graph $G$ and $H$ is the smallest number $\hat{r}$...
Saved in:
Main Authors: | Silaban, Denny Riama; Combinatorial Mathematics Research Group Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung Jalan Ganesa 10 Bandung, Indonesia (Author), Baskoro, Edy Tri; Combinatorial Mathematics Research Group Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung Jalan Ganesa 10 Bandung, Indonesia (Author), Uttunggadewa, Saladin; Combinatorial Mathematics Research Group Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung Jalan Ganesa 10 Bandung, Indonesia (Author) |
---|---|
Other Authors: | Research Grant "Program Penelitian Unggulan Perguruan Tinggi", Ministry of Research, Technology, and Higher Education, Indonesia (Contributor) |
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2017-04-10.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On size multipartite Ramsey numbers for stars versus paths and cycles
by: Lusiani, Anie; Combinatorial Mathematics Research Group Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung Jalan Ganesa 10 Bandung, Indonesia, et al.
Published: (2017) -
On the restricted size Ramsey number for P3 versus dense connected graphs
by: Silaban, Denny Riama; Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Indonesia, et al.
Published: (2020) -
The connected size Ramsey number for matchings versus small disconnected graphs
by: Assiyatun, Hilda; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, et al.
Published: (2019) -
A method to construct graphs with certain partition dimension
by: Haryeni, Debi Oktia; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jalan Ganesa 10 Bandung, Indonesia, et al.
Published: (2019) -
Total vertex irregularity strength of trees with maximum degree five
by: Susilawati, S.; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia, et al.
Published: (2018)