On Edge Clique Partitions and set Representations of Graphs
碩士 === 東海大學 === 數學系 === 97 === In 1966 Erd¨os et al. [8] proved that the edge set of any simple graph G with n vertices, no one of which is isolated vertex, can be partitioned using at most ⌊n2/4⌋ cliques. A couple of tens of years behind McGuinness proved that any greedy clique partition is such a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/88591848218469752612 |
| id |
ndltd-TW-096THU00479002 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-096THU004790022016-05-16T04:10:39Z http://ndltd.ncl.edu.tw/handle/88591848218469752612 On Edge Clique Partitions and set Representations of Graphs 圖的團分割及集合表示 Jun-Lin Guo 郭俊麟 碩士 東海大學 數學系 97 In 1966 Erd¨os et al. [8] proved that the edge set of any simple graph G with n vertices, no one of which is isolated vertex, can be partitioned using at most ⌊n2/4⌋ cliques. A couple of tens of years behind McGuinness proved that any greedy clique partition is such a partition. In this paper we prove that any set representation corresponding to it wouldn't use more than ⌊n2/4⌋ element. Tao-Ming Wang 王道明 2008 學位論文 ; thesis 66 en_US |
| collection |
NDLTD |
| language |
en_US |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 東海大學 === 數學系 === 97 === In 1966 Erd¨os et al. [8] proved that the edge set of any simple graph G with n vertices, no one of which is isolated vertex, can be partitioned using
at most ⌊n2/4⌋ cliques. A couple of tens of years behind McGuinness
proved that any greedy clique partition is such a partition.
In this paper we prove that any set representation corresponding to it wouldn't use more than ⌊n2/4⌋ element.
|
| author2 |
Tao-Ming Wang |
| author_facet |
Tao-Ming Wang Jun-Lin Guo 郭俊麟 |
| author |
Jun-Lin Guo 郭俊麟 |
| spellingShingle |
Jun-Lin Guo 郭俊麟 On Edge Clique Partitions and set Representations of Graphs |
| author_sort |
Jun-Lin Guo |
| title |
On Edge Clique Partitions and set Representations of Graphs |
| title_short |
On Edge Clique Partitions and set Representations of Graphs |
| title_full |
On Edge Clique Partitions and set Representations of Graphs |
| title_fullStr |
On Edge Clique Partitions and set Representations of Graphs |
| title_full_unstemmed |
On Edge Clique Partitions and set Representations of Graphs |
| title_sort |
on edge clique partitions and set representations of graphs |
| publishDate |
2008 |
| url |
http://ndltd.ncl.edu.tw/handle/88591848218469752612 |
| work_keys_str_mv |
AT junlinguo onedgecliquepartitionsandsetrepresentationsofgraphs AT guōjùnlín onedgecliquepartitionsandsetrepresentationsofgraphs AT junlinguo túdetuánfēngējíjíhébiǎoshì AT guōjùnlín túdetuánfēngējíjíhébiǎoshì |
| _version_ |
1718269891432153088 |