scientific article
From MaRDI portal
Publication:3236254
zbMath0072.37805MaRDI QIDQ3236254
Publication date: 1956
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A remark on the faces of the cone of Euclidean distance matrices, On dimensional rigidity of bar-and-joint frameworks, Coxeter's frieze patterns at the crossroads of algebra, geometry and combinatorics, Kneser transversals, David Gale in Paris, ReGale: some memorable results, On yielding and jointly yielding entries of Euclidean distance matrices, \(k\)-sets and rectilinear crossings in complete uniform hypergraphs, Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs, Chromatic number of random Kneser hypergraphs, Transversals to the convex hulls of all \(k\)-sets of discrete subsets of \(\mathbb R^n\), On affine motions and bar frameworks in general position, Committee polyhedral separability: complexity and polynomial approximation, Projective self-dual polygons in higher dimensions, Maximum rectilinear crossing number of uniform hypergraphs, On finding constrained independent sets in cycles, The best-worst-choice polytope on four alternatives, Unnamed Item, Fixed-Parameter Algorithms for the Kneser and Schrijver Problems, A short proof on the cardinality of maximal positive bases, Graphical designs and gale duality, On the uniqueness of Euclidean distance matrix completions., Commuting difference operators and the combinatorial Gale transform, Eigenpolytope Universality and Graphical Designs, Discrete extremal problems, On affine motions and universal rigidity of tensegrity frameworks, On Neighbourly Triangulations, Circular chromatic number of induced subgraphs of Kneser graphs, A relationship between Gale transforms and Voronoi diagrams, Combinatorial properties of incompatible systems of linear inequalities and polyhedra, On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges, On the computational complexity of the minimum committee problem, Interior points of the convex hull of few points in \(\mathbb{E}^ d\), Unnamed Item, \((n,m)\)-fold covers of spheres, Lower bounds for the number of hyperplanes separating two finite sets of points, On Zonotopes, On the dual rigidity matrix, Graph connectivity and universal rigidity of bar frameworks, Universal rigidity of bar frameworks via the geometry of spectrahedra, Geometric medians, Polytope pairs and their relationship to linear programming, On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices, On the multiple Borsuk numbers of sets, On the uniqueness of Euclidean distance matrix completions: the case of points in general position, On bar frameworks, stress matrices and semidefinite programming, Equivalent point arrangements in space and on a sphere, On representations of graphs as two-distance sets, Two theorems on Euclidean distance matrices and Gale transform, \(\mathbb{Z}\)-linear Gale duality and poly weighted spaces (PWS), Random Gale diagrams and neighborly polytopes in high dimensions, A short proof of Kneser's conjecture, Counting faces of randomly projected polytopes when the projection radically lowers dimension, A comparison of primal and dual methods of linear programming, On unit spherical Euclidean distance matrices which differ in one entry, Triangulated n-manifolds are determined by their \([n/2+1\)-skeletons], The lattice of faces of a finite dimensional cone, Topological bounds on the dimension of orthogonal representations of graphs, The projective geometry of the Gale transform., Characterization of extremal antipodal polygons, Using Gale transforms in computational geometry, Minimal sets of vectors which generate $R_n$ with excess $k$, Linear difference equations, frieze patterns, and the combinatorial Gale transform
