Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/58979| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 張宜武 | zh_TW |
| dc.contributor.advisor | Chang, Yun Kuo | en_US |
| dc.contributor.author | 林子軒 | zh_TW |
| dc.contributor.author | Lin, Zi Xuan | en_US |
| dc.creator | 林子軒 | zh_TW |
| dc.creator | Lin, Zi Xuan | en_US |
| dc.date | 2012 | en_US |
| dc.date.accessioned | 2013-07-22T10:01:32Z | - |
| dc.date.available | 2013-07-22T10:01:32Z | - |
| dc.date.issued | 2013-07-22T10:01:32Z | - |
| dc.identifier | G0967510131 | en_US |
| dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/58979 | - |
| dc.description | 碩士 | zh_TW |
| dc.description | 國立政治大學 | zh_TW |
| dc.description | 應用數學研究所 | zh_TW |
| dc.description | 96751013 | zh_TW |
| dc.description | 101 | zh_TW |
| dc.description.abstract | 在本篇論文中,藉由長方形棋盤著色探討完全二分圖 Km;n 由兩種顏色任意著邊,使得此兩色著邊之完全二分圖 Km;n 會包含單色子圖 K2;s 與 K3;s (s須大於或等於2),我們將討論參數 n 與 s 須滿足何種關係。 | zh_TW |
| dc.description.abstract | In this paper, we study the two edge-coloring of Km;n such that Km;n contains a monochromatic subgraph K2;s or K3;s. We find the relation between n , s by investigating a two coloring of a checkerboard . | en_US |
| dc.description.tableofcontents | Abstract iii\n\n中文摘要 iv\n\n第一章 緒論 1\n1.1 研究動機 1\n1.2 研究目的 2\n\n第二章 介紹 3\n2.1 介紹 3\n2.2 相關定義 4\n2.3 相關定理 6\n\n第三章 棋盤著色討論 s-四角單色矩形 7\n3.1 棋盤著色討論四角單色矩形 7\n3.2 棋盤圖轉換2色完全二分圖 11\n3.3 棋盤著色討論 s-四角單色矩形 14\n\n第四章 棋盤著色討論 s-六角單色矩形 20\n4.1 棋盤著色討論六角單色矩形 20\n4.2 棋盤著色討論 s-六角單色矩形 23\n參考文獻 25 | zh_TW |
| dc.format.extent | 971632 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.source.uri | http://thesis.lib.nccu.edu.tw/record/#G0967510131 | en_US |
| dc.subject | 完全二分圖 | zh_TW |
| dc.subject | 單色子圖 | zh_TW |
| dc.subject | Complete bipartite graph | en_US |
| dc.subject | Monochromatic subgraph | en_US |
| dc.title | 棋盤著色和完全二分圖之單色子圖 | zh_TW |
| dc.title | The coloring of a checkerboard and the monochromatic subgraphs of a complete bipartite graph | en_US |
| dc.type | thesis | en |
| dc.relation.reference | [1] J. A. Bondy and U. S. R. Murty, Graph Theory with Application, MacMillan Press, London and Basingstoke, 1976.\n[2] R. L. Graham, B. L. Rothschild and J. H. Spencer, Ramsey Theory, John Wiley and Sons Press, New York, 1980.\n[3] V. Longani, Some Bipartite Ramsey Numbers,\nSoutheast Asian Bulletin of Mathematics(2002)26: 583-592.\n[4] 張克民-Ramsey 理論; 數學傳播期刊, 數學傳播24卷4期, 35-39頁。\n[5] 李烔生-棋盤染色問題與二部Ramsey 數; 數學傳播21卷3期, 63-72頁。 | zh_TW |
| item.openairecristype | http://purl.org/coar/resource_type/c_46ec | - |
| item.cerifentitytype | Publications | - |
| item.fulltext | With Fulltext | - |
| item.openairetype | thesis | - |
| item.grantfulltext | open | - |
| item.languageiso639-1 | en_US | - |
| Appears in Collections: | 學位論文 | |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| 013101.pdf | 948.86 kB | Adobe PDF2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.