Guessing numbers of odd cycles

zbMath1358.05092arXiv1602.03586MaRDI QIDQ521366

Ross Atkins, Puck Rombach, Fiona Skerman

Publication date: 10 April 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

entropycyclesguessing numberindex codinginformation defectmultiple unicast

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Guessing numbers and extremal graph theory ⋮ On the influence of the interaction graph on a finite dynamical system

Cites Work

• Guessing games on triangle-free graphs
• The guessing number of undirected graphs
• Yet another hat game
• On the guessing number of shift graphs
• Information flows, graphs and their guessing numbers
• The linear guessing number of undirected graphs
• Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks
• Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
• Index Coding With Side Information
• Graph Guessing Games and Non-Shannon Information Inequalities
• Elements of Information Theory
• Hat Guessing Games

This page was built for publication: Guessing numbers of odd cycles