Dice Question Streamline Icon: https://streamlinehq.com

Structural characterization of d-flattenability forbidden minors

Characterize, for each integer d ≥ 0, the family of d-flattenability forbidden minors by intrinsic structural properties (beyond merely listing them as the excluded-minor set for d-flattenable graphs).

Information Square Streamline Icon: https://streamlinehq.com

Background

Flattenability in dimension d is a minor-closed property, so d-flattenable graphs admit a finite set of forbidden minors. While specific sets are known for small d (e.g., K5 and K2,2,2 for d = 3), a conceptual structural characterization of the obstructions themselves is lacking.

Such a characterization would likely be essential for extending the SIP characterization to higher dimensions without enumerating or relying on properties of large explicit forbidden-minor families.

References

Open Problem. For any integer $d \geq 0$, give a characterization of the set of $d$-flattenability forbidden minor, other than the set of minors that characterize $d$-flattenable graphs.

Graphs with single interval Cayley configuration spaces in 3-dimensions (2409.14227 - Sims et al., 21 Sep 2024) in Section 6 (Open problems and conjectures)