Boundedness of optimal matrices in extremal multigraph and digraph problems

✍ Scribed by Alexander Sidorenko

Publisher: Springer-Verlag
Year: 1993
Tongue: English
Weight: 616 KB
Volume: 13
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01202793

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Extremal Problem in the Hypercube and

An Extremal Problem in the Hypercube and Optimization of Asynchronous Circuits

✍ Carlos Gustavo T. de A. Moreira; Pablo Emanuel 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 66 KB

We prove that if m ≥ 2, then the minimum k ∈ N such that the k-cube {0, 1} k can be decomposed as the disjoint union of m connected adjacent subsets satisfies 2 log 2 mlog 2 log 2 m -1 ≤ k ≤ 2 log 2 mlog 2 log 2 m + 5.