Graph Information Ratio

DOI10.1137/16M1110066zbMath1425.94035arXiv1612.09343OpenAlexW2775526398MaRDI QIDQ4599114

Ofer Shayevitz, Lele Wang

Publication date: 18 December 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.09343

zbMATH Keywords

graph homomorphisminformation theorygraph capacity

Mathematics Subject Classification ID

Information theory (general) (94A15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coding theorems (Shannon theory) (94A24)

Related Items (1)

A unified construction of semiring-homomorphic graph invariants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On metric properties of maps between Hamming spaces and related graph homomorphisms
• Homomorphisms of 3-chromatic graphs
• n-tuple colorings and associated graphs
• The Shannon capacity of a union
• Optimization problems over unit-distance representations of graphs
• A note on the star chromatic number
• The Shannon capacity of a graph and the independence numbers of its powers
• Girth and fractional chromatic number of planar graphs
• On the Shannon capacity of a graph
• On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
• Resource convertibility and ordered commutative monoids
• Sur le coloriage des graphs
• Relative capacity and dimension of graphs

This page was built for publication: Graph Information Ratio