d-collapsing and nerves of families of convex sets
From MaRDI portal
Publication:1218654
DOI10.1007/BF01229745zbMath0308.52005MaRDI QIDQ1218654
Publication date: 1975
Published in: Archiv der Mathematik (Search for Journal in Brave)
Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Abstract complexes in algebraic topology (55U05)
Related Items
Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). II: Sufficiency of Eckhoff's conditions, Families of convex sets having convex union, Bounding the piercing number, Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry, Algebraic properties of edge ideals and cover ideals of unbalanced crown graphs, Intersections of Leray complexes and regularity of monomial ideals, Representability and boxicity of simplicial complexes, Local properties of simplicial complexes, Piercing convex sets, RELATIVE LERAY NUMBERS VIA SPECTRAL SEQUENCES, Extensions of the colorful Helly theorem for d-collapsible and d-Leray complexes, Weak Cartesian properties of simplicial sets, The Morse theory of Čech and Delaunay complexes, Die Euler-Charakteristik von Vereinigungen konvexer Mengen im R, On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs, The \(v\)-number and Castelnuovo-Mumford regularity of graphs, Regularity of powers of edge ideals: from local properties to global bounds, Bounding Helly Numbers via Betti Numbers, Unnamed Item, Leray numbers of projections and a topological Helly-type theorem, Helly’s theorem: New variations and applications, Non-ridge-chordal complexes whose clique complex has shellable Alexander dual, A counterexample to Wegner's conjecture on good covers, Neural Codes, Decidability, and a New Local Obstruction to Convexity, Colourful and fractional \((p,q)\)-theorems, Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem, A topological colorful Helly theorem, Non-representability of finite projective planes by convex sets, On connectivity of the facet graphs of simplicial complexes, Recognition of collapsible complexes is NP-complete, Collapsibility of non-cover complexes of graphs, Complexes of graphs with bounded independence number, Complexes of graphs with bounded independence number, Chordality, \(d\)-collapsibility, and componentwise linear ideals, Regularity, matchings and Cameron-Walker graphs, On minimal free resolution of edge ideals of multipartite crown graphs, Convex set and hypergraphs, Intersection patterns of convex sets, Cooperative conditions for the existence of rainbow matchings, Petruska's question on planar convex sets, Removing degeneracy in LP-type problems revisited, Dimension gaps between representability and collapsibility, Collapsibility of simplicial complexes of hypergraphs, d-collapsibility is NP-complete for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>d</mml:mi><mml:mo>⩾</mml:mo><mml:mn>4</mml:mn></mml:math>, Choice functions in the intersection of matroids, On graded Betti numbers of edge rings of deficient complete bipartite graphs, Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions, Helly-type problems, A simple proof of the upper bound theorem, Transversal numbers for hypergraphs arising in geometry
Cites Work
