#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:
| 主要作者: | |
|---|---|
| 格式: | Final Project |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/15776 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Institut Teknologi Bandung |
| 語言: | Indonesia |