scientific article; zbMATH DE number 3102257
From MaRDI portal
Publication:5837940
zbMath0061.40305MaRDI QIDQ5837940
Publication date: 1946
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
\(O_n\) is an \(n\)-MCFL, Consensus-Halving: Does It Ever Get Easier?, Ein Satz über stetige Funktionen auf der Kugelfläche, Equipartition of mass distributions by hyperplanes, A combinatorial proof of the Borsuk-Ulam antipodal point theorem, Chromatic number of random Kneser hypergraphs, On the combinatorial antipodal-point lemmas, Unnamed Item, A new coloring theorem of Kneser graphs, A constructive proof of Tucker's combinatorial lemma, New construction of graphs with high chromatic number and small clique number, Circular chromatic number of induced subgraphs of Kneser graphs, Proving Tucker’s Lemma with a volume argument, A generalization of Kneser's conjecture, On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs, Lattice embeddings in percolation, On the chromatic number of general Kneser hypergraphs, Colorful subgraphs in Kneser-like graphs, Combinatorial Stokes formulae, Topological Bounds for Graph Representations over Any Field, Colorful subhypergraphs in uniform hypergraphs, On the existence and approximation of zeroes, Extensions of Sperner and Tucker's lemma for manifolds, The chromatic number of almost stable Kneser hypergraphs, A combinatorial analog of a theorem of F.J. Dyson, The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics, Existence of balanced simplices on polytopes., Topologic proofs of some combinatorial theorems, Combinatorial Stokes formulas via minimal resolutions, Consensus-halving via theorems of Borsuk-Ulam and Tucker, Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron, Notes on some theorems on the sphere, Multilabeled Versions of Sperner's and Fan's Lemmas and Applications, A constructive proof of Ky Fan's generalization of Tucker's lemma, Two's company, three's a crowd: consensus-halving for a constant number of agents, The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich, Borsuk-Ulam type theorems for \(G\)-spaces with applications to Tucker type lemmas
