Restricted size Ramsey number for path of order three versus graph of order five

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}$...

Full description

Saved in:
Bibliographic Details
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:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

Get Fulltext

3rd Floor Main Library

Holdings details from 3rd Floor Main Library
Call Number: A1234.567
Copy 1 Available

Similar Items