Skip to search formSkip to main contentSkip to account menu

Sperner's lemma

Known as: Sperner coloring, Sperner lemma 
In mathematics, Sperner's lemma is a combinatorial analog of the Brouwer fixed point theorem, which is equivalent to it. Sperner's lemma states that… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
2014
2014
We present a new method of detecting vortices in sampled vector fields by using Geometric Algebra, and tested three swirl-plane… 
2012
2012
Aydinian et al. [J. Combinatorial Theory A 118 (2)(2011), 702---725] substituted the usual BLYM inequality for L-Sperner families… 
2010
2010
2010
2010
Korner and Malvenuto asked whether one can find $\binom{n}{\lfloor n/2\rfloor}$ linear orderings (i.e., permutations) of the… 
2009
2009
It is by now common knowledge that Brouwer gave mathematics in 1911 a miraculous tool, the fixed point theorem, and that later in… 
2009
2009
The classical concept of Shannon capacity of undirected graphs was extended by Gargano, Korner, and Vaccaro to digraphs in the… 
2007
2007
In this paper existence results of positive solutions, by means of a new approaches, for the $3^(the)$ order three-point BVP… 
1989
1989
The profile of a hypergraph onn vertices is (f0,...,fn) wherefi denotes the number ofi-element edges. The extreme points of the… 
1988
1988
We propose a combinatorial framework for fixed point algorithms and constructive proofs of combi· natoriallemmas in topology. The…