The sandwich theorem (1994) [30 citations — 0 self]
Download:
|
|
by Donald E. Knuth
Electronic J. Combinatorics
http://www.math.helsinki.fi/EMIS/journals/EJC/Volume_1/../Volume_1/PostScriptfiles/v1i1a1.ps
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Knuth94thesandwich,author = {Donald E. Knuth},
title = {The sandwich theorem},
journal = {Electronic J. Combinatorics},
year = {1994},
volume = {1},
pages = {1}
}
Years of Citing Articles
Abstract:
Abstract: This report contains expository notes about a function #(G) that is popularly known as the Lov'asz number of a graph G. There are many ways to define #(G), and the surprising variety of different characterizations indicates in itself that #(G) should be interesting. But the most interesting property of #(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'asz's fascinating function.
