Entropy splitting for antiblocking corners and perfect graphs
From MaRDI portal
Publication:810528
DOI10.1007/BF02122693zbMath0734.05061WikidataQ100603844 ScholiaQ100603844MaRDI QIDQ810528
János Körner, Gábor Simonyi, László Lovász, Imre Csiszár, Katalin Marton
Publication date: 1990
Published in: Combinatorica (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
05C99: Graph theory
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Energy of convex sets, shortest paths, and resistance, Structural information content of networks: graph entropy based on local vertex functionals, Constructions for normal graphs and some consequences, Perfect couples of graphs, On the odd cycles of normal graphs, ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods, On the capacity of Boolean graph formulæ, Line-graphs of cubic graphs are normal, An ergodic theorem for constrained sequences of functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relaxations of vertex packing
- New bounds for perfect hashing via information theory
- On the Shannon capacity of probabilistic graphs
- On certain polytopes associated with graphs
- Fredman–Komlós bounds and information theory
- On the Shannon capacity of a graph
- Two-step encoding for finite sources
- Blocking and anti-blocking pairs of polyhedra
