#TITLE_ALTERNATIVE#
Graph G is a nonempty set V(G) of vertices and a set E(G) of edges. For any positive integer m,n, a ramsey number r(m,n) is the least integer r such that for any red-blue coloring on the edges of complete graph Kr on r vertices there always exists either a red complete graph Km or a blue complete gr...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/15776 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |