RAMSEY (P3; P6)-MINIMAL GRAPHS
Let F, G and H be graphs. The notation F !(G;H) means that any red-blue coloring of the edges of F contains a red subgraph G or a blue subgraph H. Graph F is called a Ramsey (G;H)-minimal graph if it satisfies that F !(G;H) and F - e ->(G;H) for any e 2 E(F). The notation R(G;H) is the set of...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/33604 |
| 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!