✦ LIBER ✦

On a Problem of Zaks

✍ Scribed by Alan J. Hoffman

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 86 KB
Volume: 93
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.2000.3083

No coin nor oath required. For personal study only.

✦ Synopsis

Let M m be a matching with m edges, n 2m. We prove that the smallest number of complete bipartite graphs which partition the edges of K n +M m is at least n&m+w-2mx&1.

📜 SIMILAR VOLUMES

On a Problem of Solynin

✍ James Jenkins 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB 👁 1 views

On a Problem of Littlewood

✍ Horst Alzer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 90 KB

On a Problem of Erdős

✍ Csaba Sándor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Theorem 1. For every n 2 there exist integers 1<a 1 <a 2 < } } } <a s such that s i=1 1Âa i <n and this sum cannot be split into n parts so that all partial sums are 1.

On a problem of rota

✍ E.Rodney Canfield 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 423 KB

On a problem of T. Kato

✍ H. Brezis 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

On a Problem of I. Györl.

✍ D.T. Zhou 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 84 KB