#TITLE_ALTERNATIVE#

#TITLE_ALTERNATIVE#

Ramsey Online Game developed by J.A Grytczuk and M. Haluszxzak and also Jozsef Balogh and Jane Buterfield based on knowledge of Ramsey Numbers. Given positive integer m and n, we want to find the smallest integer r= r(m,n) such that if edges of complete graph Kr with r arbitrary vertices color with...

Full description

Saved in:
Bibliographic Details
Main Author: IRSYADUL FAHMI YZ (NIM : 101 07 014); Pembimbing : Prof. Dr. Edy Tri Baskoro
Format: Final Project
Language:Indonesia
Online Access:https://digilib.itb.ac.id/gdl/view/16107
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Institut Teknologi Bandung
Language: Indonesia
id id-itb.:16107
spelling id-itb.:161072017-09-27T11:43:10Z#TITLE_ALTERNATIVE# IRSYADUL FAHMI YZ (NIM : 101 07 014); Pembimbing : Prof. Dr. Edy Tri Baskoro, Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/16107 Ramsey Online Game developed by J.A Grytczuk and M. Haluszxzak and also Jozsef Balogh and Jane Buterfield based on knowledge of Ramsey Numbers. Given positive integer m and n, we want to find the smallest integer r= r(m,n) such that if edges of complete graph Kr with r arbitrary vertices color with 2-coloured (red and blue) then sub graph red Km or blue Km appears. In other words, for every arbitrary graph F with r vertices: F has red Km or complement of F has Km as sub graph. <br /> <br /> <br /> Ramsey Online Games played on unbounded set of vertices. There are two players, Builder and Painter. On each move, Builder shows an edge then Painter colored it. The goal is to force Painter make graph H. The main problem of this game is to recognize the winner if given vertices and graph H. Graph H in this final project is a cycle. <br /> <br /> <br /> On this final project, we investigate the game strategy and make Ramsey Online Games. text
institution Institut Teknologi Bandung
building Institut Teknologi Bandung Library
continent Asia
country Indonesia
Indonesia
content_provider Institut Teknologi Bandung
collection Digital ITB
language Indonesia
description Ramsey Online Game developed by J.A Grytczuk and M. Haluszxzak and also Jozsef Balogh and Jane Buterfield based on knowledge of Ramsey Numbers. Given positive integer m and n, we want to find the smallest integer r= r(m,n) such that if edges of complete graph Kr with r arbitrary vertices color with 2-coloured (red and blue) then sub graph red Km or blue Km appears. In other words, for every arbitrary graph F with r vertices: F has red Km or complement of F has Km as sub graph. <br /> <br /> <br /> Ramsey Online Games played on unbounded set of vertices. There are two players, Builder and Painter. On each move, Builder shows an edge then Painter colored it. The goal is to force Painter make graph H. The main problem of this game is to recognize the winner if given vertices and graph H. Graph H in this final project is a cycle. <br /> <br /> <br /> On this final project, we investigate the game strategy and make Ramsey Online Games.
format Final Project
author IRSYADUL FAHMI YZ (NIM : 101 07 014); Pembimbing : Prof. Dr. Edy Tri Baskoro,
spellingShingle IRSYADUL FAHMI YZ (NIM : 101 07 014); Pembimbing : Prof. Dr. Edy Tri Baskoro,
#TITLE_ALTERNATIVE#
author_facet IRSYADUL FAHMI YZ (NIM : 101 07 014); Pembimbing : Prof. Dr. Edy Tri Baskoro,
author_sort IRSYADUL FAHMI YZ (NIM : 101 07 014); Pembimbing : Prof. Dr. Edy Tri Baskoro,
title #TITLE_ALTERNATIVE#
title_short #TITLE_ALTERNATIVE#
title_full #TITLE_ALTERNATIVE#
title_fullStr #TITLE_ALTERNATIVE#
title_full_unstemmed #TITLE_ALTERNATIVE#
title_sort #title_alternative#
url https://digilib.itb.ac.id/gdl/view/16107
_version_ 1820737624302682112

Similar Items