Information flows, graphs and their guessing numbers

zbMath1122.05041MaRDI QIDQ2372888

Søren Riis

Publication date: 16 July 2007

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

Full work available at URL: https://eudml.org/doc/128036

zbMATH Keywords

communicationinformationcircuit complexitynetwork codingcyclic shifts

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20) Coding theorems (Shannon theory) (94A24)

Related Items (24)

Fixed points in conjunctive networks and maximal independent sets in graph contractions ⋮ Guessing games on triangle-free graphs ⋮ Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory ⋮ Guessing numbers and extremal graph theory ⋮ Finite Dynamical Systems, Hat Games, and Coding Theory ⋮ A Numbers-on-Foreheads Game ⋮ Bears with hats and independence polynomials ⋮ Max-flow min-cut theorems on dispersion and entropy measures for communication networks ⋮ Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks ⋮ On the influence of the interaction graph on a finite dynamical system ⋮ Hat guessing numbers of degenerate graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Positive and negative cycles in Boolean networks ⋮ The linear guessing number of undirected graphs ⋮ The minrank of random graphs ⋮ The three colour hat guessing game on cycle graphs ⋮ Guessing numbers of odd cycles ⋮ On the rank and periodic rank of finite dynamical systems ⋮ Lower Bounds for Multiplication via Network Coding ⋮ On the guessing number of shift graphs ⋮ On the stability and instability of finite dynamical systems with prescribed interaction graphs ⋮ The hat guessing number of graphs ⋮ New Constructions and Bounds for Winkler's Hat Game

This page was built for publication: Information flows, graphs and their guessing numbers