The sandwich theorem
| dc.creator | Knuth, Donald E. | |
| dc.date | 1993-12-06 | |
| dc.date.accessioned | 2026-07-07T09:15:01Z | |
| dc.date.available | 2026-07-07T09:15:01Z | |
| dc.description | This report contains expository notes about a function $\vartheta(G)$ that is popularly known as the Lovász number of a graph~$G$. There are many ways to define $\vartheta(G)$, and the surprising variety of different characterizations indicates in itself that $\vartheta(G)$ should be interesting. But the most interesting property of $\vartheta(G)$ is probably the fact that it can be computed efficiently, although it lies ``sandwiched'' between other classic graph numbers whose computation is NP-hard. I~have tried to make these notes self-contained so that they might serve as an elementary introduction to the growing literature on Lovász's fascinating function. | |
| dc.identifier | https://arxiv.org/abs/math/9312214 | |
| dc.identifier | http://arxiv.org/abs/math/9312214 | |
| dc.identifier | Electron. J. Combin. 1 (1994), #A1 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/152886 | |
| dc.subject | Combinatorics | |
| dc.title | The sandwich theorem | |
| dc.type | text |