THE CONNECTED SIZE RAMSEY NUMBER FOR MATCHINGS
Given graphs G and H, the notation F?(G,H) means that in any red-blue coloring of the edges of F there exists a red subgraph G or a blue subgraph H in F. The size Ramsey number of a pair of graphs G and H, denoted by r ?(G,H), is the smallest integer k such that there is a graph F with k edges s...
Saved in:
| Main Author: | |
|---|---|
| Format: | Dissertations |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/36176 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
Be the first to leave a comment!