✦ LIBER ✦

On a problem of Sperner's type

✍ Scribed by G. Burosch; K.-D. Drevs; V.K. Leont'ev

Publisher: Elsevier Science
Year: 1982
Weight: 395 KB
Volume: 22
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(82)90142-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A solution of the Sperner-Erdös problem

✍ X. Berenguer; J. Díaz; L.H. Harper 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 495 KB

A new proof of a theorem of Harper on th

A new proof of a theorem of Harper on the Sperner-Erdös problem

✍ Konrad Engel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Nontrivial solutions of a nonlinear heat

Nontrivial solutions of a nonlinear heat flow problem via Sperner’s Lemma

✍ P.K. Palamides; G. Infante; P. Pietramala 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 499 KB

In this paper we investigate the existence of multiple nontrivial solutions of a nonlinear heat flow problem with nonlocal boundary conditions. Our approach relies on the properties of a vector field on the phase plane and utilizes Sperner's Lemma, combined with the continuum property of the solutio

A Sperner-type theorem for families of f

A Sperner-type theorem for families of finite sets

✍ P. Frankl 📂 Article 📅 1978 🏛 Springer Netherlands 🌐 English ⚖ 413 KB

A continuous analogue of Sperner's theor

A continuous analogue of Sperner's theorem

✍ Daniel A. Klain; Gian-Carlo Rota 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 2 views

One of the best-known results of extremal combinatorics is Sperner's theorem, which asserts that the maximum size of an antichain of subsets of an n-element set equals the binomial coefficient n n/2 , that is, the maximum of the binomial coefficients. In the last twenty years, Sperner's theorem has

A Polytopal Generalization of Sperner's

A Polytopal Generalization of Sperner's Lemma

✍ Jesus A. De Loera; Elisha Peterson; Francis Edward Su 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 235 KB

We prove the following conjecture of Atanassov (Studia Sci. Math. Hungar. 32 (1996), 71-74). Let T be a triangulation of a d-dimensional polytope P with n vertices v 1 ; v 2 ; . . . ; v n : Label the vertices of T by 1; 2; . . . ; n in such a way that a vertex of T belonging to the interior of a fac