Dec 15, 1988 · Minimal pairs with this property are antiblocking pairs of convex corners. This result is closely related to a new entropy concept. The main ...

Minimal pairs with this property are antiblocking pairs of convex corners. This result is closely related to a new entropy concept. The main application is ...

The entropy of a graph is a functional depending both on the graph itself and on a probability distribution on its vertex set. This concept is at the core of a ...

Oct 12, 2023 · This result is closely related to a new entropy concept. The main application is an information theoretic characterization of perfect graphs. 1.

Körner, L. Lovász, K. Marton, G. Simonyi. Entropy splitting for antiblocking corners and perfect graphs. Combinatorica, 10 (1990), pp. 27-40. View in Scopus ...

Co-authors ; Entropy splitting for antiblocking corners and perfect graphs. I Csiszár, J Körner, L Lovász, K Marton, G Simonyi. Combinatorica 10, 27-40, 1990.

This concept is at the core of a new bounding technique for graph covering problems and has furnished the best known bounds for the problem of perfect hashing.

Oct 3, 2022 · Our notion of doubly-perfect hypergraphs is closely related (and yet not identical) to Simonyi's notion of “entropy splitting hypergraphs” [21].

I. Csiszár et al. Entropy splitting for antiblocking corners and perfect graphs. Combinatorica. (1990).

Nov 22, 2013 · The entropy of a graph is a functional depending both on the graph itself and on a probability distribution on its vertex set.