Guessing games on triangle-free graphs

zbMath1335.05119arXiv1410.2405MaRDI QIDQ278884

Peter J. Cameron, Søren Riis, Anh N. Dang

Publication date: 3 May 2016

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

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

zbMATH Keywords

triangle-free graphsguessing gamefractional clique cover

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (4)

Guessing numbers and extremal graph theory ⋮ Construction of storage codes of rate approaching one on triangle-free graphs ⋮ The three colour hat guessing game on cycle graphs ⋮ Guessing numbers of odd cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The guessing number of undirected graphs
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Information flows, graphs and their guessing numbers
• A simple group of order 44,352,000
• Networks, Matroids, and Non-Shannon Information Inequalities
• Reversible and Irreversible Information Networks
• Network information flow
• On characterization of entropy function via information inequalities
• Reducibility among Combinatorial Problems
• Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
• Graph Guessing Games and Non-Shannon Information Inequalities
• Elements of Information Theory

This page was built for publication: Guessing games on triangle-free graphs