๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the eighteenth annual ACM symposium - Berkeley, California, United States (1986.05.28-1986.05.30)] Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 - Four pages are necessary and sufficient for planar graphs

โœ Scribed by Yannakakis, M

Book ID
120819356
Publisher
ACM Press
Year
1986
Weight
466 KB
Category
Article
ISBN-13
9780897911931

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[ACM Press the eighteenth annual ACM sym
[ACM Press the eighteenth annual ACM symposium - Berkeley, California, United States (1986.05.28-1986.05.30)] Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 - Explicit expanders and the Ramanujan conjectures
โœ Lubotzky, A; Phillips, R; Sarnak, P ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› ACM Press โš– 284 KB

1. Background. The aim of this note is to give an explicit construction of a rich family of k-regular (except for k ยฐ =k) of the adjacency matrix satisfy Ikjl < 2 k~-l. graphs for which all the eigenvalues kj This bound is optimal (see Proposition 2.1). We call such graphs Ramanujan graphs. These g