@inproceedings{7941159a7a2241069ba17bea66f2ffd8,
title = "Lov{\'a}sz, Vectors, Graphs and Codes",
abstract = "A family of high-degree triangle-free pseudo-random Cayley graphs has been constructed in (Alon, Electro J Combin 1(R12):8, 1994 [2]), motivated by a geometric question of Lov{\'a}sz. These graphs turned out to be useful in tackling a variety of additional extremal problems in Graph Theory and Coding Theory. Here we describe the graphs and their applications, and mention several intriguing related open problems. This is mainly a survey, but it contains several new results as well. One of these is a construction showing that the Lov{\'a}sz (formula presented)-function of a graph cannot be bounded by any function of its Shannon capacity.",
keywords = "Cayley graphs, List decodable codes, Maxcut, Ramsey graphs, Shannon capacity of graphs, The -function",
author = "Noga Alon",
note = "Publisher Copyright: {\textcopyright} 2019, J{\'a}nos Bolyai Mathematical Society and Springer-Verlag GmbH Germany, part of Springer Nature.; Mathematical Conference to celebrate 70th birthday of Laszlo Lovasz, 2018 ; Conference date: 02-07-2018 Through 06-07-2018",
year = "2019",
doi = "10.1007/978-3-662-59204-5\_1",
language = "English (US)",
isbn = "9783662592038",
series = "Bolyai Society Mathematical Studies",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "1--16",
editor = "Imre B{\'a}r{\'a}ny and Katona, \{Gyula O.\} and Attila Sali",
booktitle = "Building Bridges II - Mathematics of L{\'a}szl{\'o} Lov{\'a}sz",
address = "Germany",
}