The guessing number of undirected graphs (Q640453)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The guessing number of undirected graphs |
scientific article; zbMATH DE number 5960054
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The guessing number of undirected graphs |
scientific article; zbMATH DE number 5960054 |
Statements
The guessing number of undirected graphs (English)
0 references
18 October 2011
0 references
Summary: \textit{S. Riis} [Electron. J. Comb. 14, No. 1, R44, 17 p. (2007; Zbl 1122.05041)] introduced a guessing game for graphs which is equivalent to finding protocols for network coding. In this paper we prove upper and lower bounds for the winning probability of the guessing game on undirected graphs. We find optimal bounds for perfect graphs and minimally imperfect graphs, and present a conjecture relating the exact value for all graphs to the fractional chromatic number.
0 references
protocols for network coding
0 references
0.95297205
0 references
0.9201515
0 references
0 references
0.8842117
0 references
0.87487316
0 references
0.87408483
0 references
0.87232155
0 references
0.87010074
0 references
0.8697722
0 references
