Enumeration of interval graphs and d-representable complexes

MaRDI QIDQ6394436zbMATH OpenFDO

Authors Boris Bukh, R. Amzi Jeffs

Publication date 22 March 2022

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Abstract: For each fixed $dge1$, 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.

This page was built for publication: Enumeration of interval graphs and $d$-representable complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6394436)