✦ LIBER ✦

Explicit constructions of linear-sized superconcentrators

✍ Scribed by Ofer Gabber; Zvi Galil

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 700 KB
Volume: 22
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(81)90040-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Explicit construction of linear sized to

Explicit construction of linear sized tolerant networks

✍ N. Alon; F.R.K. Chung 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 369 KB

For every E > 0 and every integer m > 0, we construct explicitly graphs with O(m/e) vertices and maximum degree 0(1/e\*), such that after removing any (1 -l ) portion of their vertices or edges, the remaining graph still contains a path of length m. This settles a problem of Rosenberg, which was mot

Construction of expanders and superconce

Construction of expanders and superconcentrators using Kolmogorov complexity

✍ Uwe Schöning 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual probabilistic construction. It turns out that the best known bounds on the size of expanders and superconcentrators can be attained based on this method. In the case of (

Explicit construction of exponential siz

Explicit construction of exponential sized families of k-independent sets

✍ N Alon 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Error correcting codes are used to describe explicit collections Fk of subsets of {1, 2,... n}, with IFkl > 2 ckn (ck > 0), such that for any selections A, B of kl and k 2 of members of Fk with kl + k2 = k, there are elements in all the members of A and not in the members of B. This settles a proble

A geometric construction of a superconce

A geometric construction of a superconcentrator of depth 2

✍ Roy Meshulam 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 416 KB

Explicit Construction of Framelets

✍ Alexander Petukhov 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 158 KB

We study tight wavelet frames associated with given refinable functions which are obtained with the unitary extension principles. All possible solutions of the corresponding matrix equations are found. It is proved that the problem of the extension may be always solved with two framelets. In particu

Explicit constructions of triple systems

Explicit constructions of triple systems for Ramsey–Turán problems

✍ Dhruv Mubayi; Vera T. Sós 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 68 KB

## Abstract We explicitly construct four infinite families of irreducible triple systems with Ramsey‐Turán density less than the Turán density. Two of our families generalize isolated examples of Sidorenko 14, and the first author and Rödl 12. Our constructions also yield two infinite families of i