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 |
| Summary: | 碩士 === 東海大學 === 數學系 === 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.
|
|---|