. . . . . . . . . "Lov\u00E1sz Number"@en . . . . "\u0427\u0438\u0441\u043B\u043E \u041B\u043E\u0432\u0430\u0441\u0430 \u0433\u0440\u0430\u0444\u0430 \u2014 \u0432\u0435\u0449\u0435\u0441\u0442\u0432\u0435\u043D\u043D\u043E\u0435 \u0447\u0438\u0441\u043B\u043E, \u043A\u043E\u0442\u043E\u0440\u043E\u0435 \u044F\u0432\u043B\u044F\u0435\u0442\u0441\u044F \u0432\u0435\u0440\u0445\u043D\u0435\u0439 \u0433\u0440\u0430\u043D\u0438\u0446\u0435\u0439 \u0451\u043C\u043A\u043E\u0441\u0442\u0438 \u0428\u0435\u043D\u043D\u043E\u043D\u0430 \u044D\u0442\u043E\u0433\u043E \u0433\u0440\u0430\u0444\u0430. \u0427\u0438\u0441\u043B\u043E \u041B\u043E\u0432\u0430\u0441\u0430 \u0438\u0437\u0432\u0435\u0441\u0442\u043D\u043E \u0442\u0430\u043A\u0436\u0435 \u043F\u043E\u0434 \u0438\u043C\u0435\u043D\u0435\u043C \u0442\u0435\u0442\u0430-\u0444\u0443\u043D\u043A\u0446\u0438\u044F \u041B\u043E\u0432\u0430\u0441\u0430 \u0438 \u043E\u0431\u044B\u0447\u043D\u043E \u043E\u0431\u043E\u0437\u043D\u0430\u0447\u0430\u0435\u0442\u0441\u044F \u043A\u0430\u043A . \u042D\u0442\u043E \u0447\u0438\u0441\u043B\u043E \u0432\u043F\u0435\u0440\u0432\u044B\u0435 \u0432\u0432\u0451\u043B \u041B\u0430\u0441\u043B\u043E \u041B\u043E\u0432\u0430\u0441 \u0432 \u0441\u0442\u0430\u0442\u044C\u0435 1979 \u0433\u043E\u0434\u0430 \u00ABOn the Shannon Capacity of a Graph\u00BB (\u00AB\u041E \u0451\u043C\u043A\u043E\u0441\u0442\u0438 \u0428\u0435\u043D\u043D\u043E\u043D\u0430 \u0433\u0440\u0430\u0444\u0430\u00BB)."@ru . . . . . . "\u0427\u0438\u0441\u043B\u043E \u041B\u043E\u0432\u0430\u0441\u0430 \u0433\u0440\u0430\u0444\u0430 \u2014 \u0432\u0435\u0449\u0435\u0441\u0442\u0432\u0435\u043D\u043D\u043E\u0435 \u0447\u0438\u0441\u043B\u043E, \u043A\u043E\u0442\u043E\u0440\u043E\u0435 \u044F\u0432\u043B\u044F\u0435\u0442\u0441\u044F \u0432\u0435\u0440\u0445\u043D\u0435\u0439 \u0433\u0440\u0430\u043D\u0438\u0446\u0435\u0439 \u0451\u043C\u043A\u043E\u0441\u0442\u0438 \u0428\u0435\u043D\u043D\u043E\u043D\u0430 \u044D\u0442\u043E\u0433\u043E \u0433\u0440\u0430\u0444\u0430. \u0427\u0438\u0441\u043B\u043E \u041B\u043E\u0432\u0430\u0441\u0430 \u0438\u0437\u0432\u0435\u0441\u0442\u043D\u043E \u0442\u0430\u043A\u0436\u0435 \u043F\u043E\u0434 \u0438\u043C\u0435\u043D\u0435\u043C \u0442\u0435\u0442\u0430-\u0444\u0443\u043D\u043A\u0446\u0438\u044F \u041B\u043E\u0432\u0430\u0441\u0430 \u0438 \u043E\u0431\u044B\u0447\u043D\u043E \u043E\u0431\u043E\u0437\u043D\u0430\u0447\u0430\u0435\u0442\u0441\u044F \u043A\u0430\u043A . \u042D\u0442\u043E \u0447\u0438\u0441\u043B\u043E \u0432\u043F\u0435\u0440\u0432\u044B\u0435 \u0432\u0432\u0451\u043B \u041B\u0430\u0441\u043B\u043E \u041B\u043E\u0432\u0430\u0441 \u0432 \u0441\u0442\u0430\u0442\u044C\u0435 1979 \u0433\u043E\u0434\u0430 \u00ABOn the Shannon Capacity of a Graph\u00BB (\u00AB\u041E \u0451\u043C\u043A\u043E\u0441\u0442\u0438 \u0428\u0435\u043D\u043D\u043E\u043D\u0430 \u0433\u0440\u0430\u0444\u0430\u00BB)."@ru . . . . . . . . . . . . "In graph theory, the Lov\u00E1sz number of a graph is a real number that is an upper bound on the Shannon capacity of the graph. It is also known as Lov\u00E1sz theta function and is commonly denoted by , using a script form of the Greek letter theta to contrast with the upright theta used for Shannon capacity. This quantity was first introduced by L\u00E1szl\u00F3 Lov\u00E1sz in his 1979 paper On the Shannon Capacity of a Graph. Accurate numerical approximations to this number can be computed in polynomial time by semidefinite programming and the ellipsoid method.It is sandwiched between the chromatic number and clique number of any graph, and can be used to compute these numbers on graphs for which they are equal, including perfect graphs."@en . "In graph theory, the Lov\u00E1sz number of a graph is a real number that is an upper bound on the Shannon capacity of the graph. It is also known as Lov\u00E1sz theta function and is commonly denoted by , using a script form of the Greek letter theta to contrast with the upright theta used for Shannon capacity. This quantity was first introduced by L\u00E1szl\u00F3 Lov\u00E1sz in his 1979 paper On the Shannon Capacity of a Graph."@en . . . . "Lov\u00E1sz number"@en . . . . "15875"^^ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . "SandwichTheorem"@en . . . "\u0427\u0438\u0441\u043B\u043E \u041B\u043E\u0432\u0430\u0441\u0430"@ru . . . . . . . . . "1096683489"^^ . "LovaszNumber"@en . . . . "Sandwich Theorem"@en . . . . . . . "28111101"^^ . . . . . . .