Bounds on Shannon Capacity and Ramsey Numbers From Product of Graphs

DOI10.1109/TIT.2013.2256951zbMath1364.94481arXiv1201.0304OpenAlexW2045213991MaRDI QIDQ5346408

Xiaodong Xu, Stanislaw P. Radziszowski

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Applications of graph theory (05C90) Generalized Ramsey theory (05C55) Channel models (including quantum) in information and communication theory (94A40) Sampling theory in information and communication theory (94A20)

Related Items

A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers \(R(3, k)\) ⋮ The zero-error capacity of binary channels with 2-memories ⋮ On a diagonal conjecture for classical Ramsey numbers ⋮ On Some Open Questions for Ramsey and Folkman Numbers