### Abstract

Summary form only given. Graph entropy H(G, P) is an information-theoretic functional on a graph G with a probability distribution P on its vertices and is subadditive in a certain sense. Korner and Marton proved that bipartite graphs are strongly splitting while odd cycles are not. They conjectured that all perfect graphs are strongly splitting. The authors have proved this conjecture.

Original language | English |
---|---|

Pages | 60-61 |

Number of pages | 2 |

Publication status | Published - Dec 1 1988 |

### ASJC Scopus subject areas

- Engineering(all)

## Fingerprint Dive into the research topics of 'Perfect graphs split entropies'. Together they form a unique fingerprint.

## Cite this

Korner, J., Lovasz, L., & Simonyi, G. (1988).

*Perfect graphs split entropies*. 60-61.