@inproceedings{a2afa4373f794e9cafff0122e5c2a898,
title = "A bound on the shannon capacity via a linear programming variation",
abstract = "We prove an upper bound on the Shannon capacity of a graph via a linear programming variation. We also show that our bound can be better than Lov{\'a}sz theta number and Haemers minimum rank bound.",
author = "Sihuang Hu and Itzhak Tamo and Ofer Shayevitz",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",
year = "2017",
month = aug,
day = "9",
doi = "10.1109/ISIT.2017.8006691",
language = "الإنجليزيّة",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1063--1066",
booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",
address = "الولايات المتّحدة",
}