Representability and boxicity of simplicial complexes
From MaRDI portal
Publication:2167318
DOI10.1007/s00454-021-00332-1zbMath1505.55028arXiv2008.09997OpenAlexW3210928070MaRDI QIDQ2167318
Publication date: 25 August 2022
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.09997
Simplicial sets and complexes in algebraic topology (55U10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal problems related to Betti numbers of flag complexes
- Results on the regularity of square-free monomial ideals
- Computing the boxicity of a graph by covering its complement by cointerval graphs
- On a packing and covering problem
- On intersections of interval graphs
- d-collapsing and nerves of families of convex sets
- Note on a combinatorial application of Alexander duality
- Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
- Complexes of graphs with bounded independence number