Year: 2025
Type: article
Abstract: For each fixed d ≥ 1, we obtain asymptotic estimates for the number of d -representable simplicial complexes on n vertices as a function of n . The case d = 1 corresponds to counting interval graphs, and we obtain new results in this well-studied case as well. Our results imply that the d -representable complexes comprise a vanishingly small fraction of d -collapsible complexes.
Source: Israel Journal of Mathematics
Authors: Boris Bukh, R. Amzi Jeffs
Institution: Carnegie Mellon University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,290
OpenAlex ID: W4414080978