The sandwich theorem
The electronic journal of combinatorics, Tome 1 (1994)
This report contains expository notes about a function $\theta(G)$ that is popularly known as the Lovász number of a graph $G$. There are many ways to define $\theta(G)$, and the surprising variety of different characterizations indicates in itself that $\theta(G)$ should be interesting. But the most interesting property of $\theta(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.
DOI :
10.37236/1193
Classification :
05C15, 05C78, 52B55, 68R10
Mots-clés : sandwich theorem, Lovász number, graph numbers, Lovász function
Mots-clés : sandwich theorem, Lovász number, graph numbers, Lovász function
@article{10_37236_1193,
author = {Donald E. Knuth},
title = {The sandwich theorem},
journal = {The electronic journal of combinatorics},
year = {1994},
volume = {1},
doi = {10.37236/1193},
zbl = {0810.05065},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1193/}
}
Donald E. Knuth. The sandwich theorem. The electronic journal of combinatorics, Tome 1 (1994). doi: 10.37236/1193
Cité par Sources :