Enumeration of interval graphs and d-representable complexes

DOI10.1007/S11856-025-2814-2MaRDI QIDQ7263490zbMATH OpenFDO

Authors Boris Bukh, R. Amzi Jeffs

Publication date 12 June 2026

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11856-025-2814-2

Mathematics Subject Classification ID

Enumerative combinatorics (05Axx) Graph theory (05Cxx) General convexity (52Axx)

Cites work

• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Almost all string graphs are intersection graphs of plane convex sets
• An upper-bound theorem for families of convex sets
• Counting Interval Graphs
• d-collapsing and nerves of families of convex sets
• Dimension gaps between representability and collapsibility
• Efficient enumeration of non-isomorphic interval graphs
• Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
• scientific article; zbMATH DE number 3910422 (Why is no real title available?)
• scientific article; zbMATH DE number 4007126 (Why is no real title available?)
• scientific article; zbMATH DE number 3625441 (Why is no real title available?)
• Intersection patterns of convex sets
• Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
• Non-representability of finite projective planes by convex sets
• On the enumeration of interval graphs
• Optimal Distance Labeling for Interval Graphs and Related Graph Families
• Recognition of collapsible complexes is NP-complete
• Succinct encodings for families of interval graphs
• Vassiliev invariants and a strange identity related to the Dedekind eta-function

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 Q7263490)