Hostname: page-component-cb9f654ff-w5vf4 Total loading time: 0 Render date: 2025-08-16T18:47:54.481Z Has data issue: false hasContentIssue false
  • English
  • Français

A proof of Sperner's lemma via Hall's theorem

Published online by Cambridge University Press:  24 October 2008

T. C. Brown
T. C. Brown
Affiliation:
Simon Fraser University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let S be a Sperner set of subsets of {1, 2, …, n}. (That is, for A, B ∈ S, if A ≠ B then A ⊄ B and B ⊄ A.) Then

Information

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 78 , Issue 3 , November 1975 , pp. 387
Copyright
Copyright © Cambridge Philosophical Society 1975

References

REFERENCES

(1)Hall, P.On representation of subsets. J. London Math. Soc. 10 (1935), 26–30.CrossRefGoogle Scholar
(2)Lubell, D.A short proof of Sperner's lemma J. Combinatorial Theory 1 (1966), 299.CrossRefGoogle Scholar
(3)Sperner, E.Ein Satz über Untermengen einer endlichen Menge. Math. Z. 27 (1928), 544–548.CrossRefGoogle Scholar