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

Monotonicity of total Betti numbers under contracting the connecting edge

Ascertain whether, for every graph G obtained by connecting two disjoint connected graphs G1 and G2 by a single edge e = {x,y}, the inequality βi(K[G]) ≥ βi(K[G e]) holds for all i ≥ 0.

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

Background

The paper shows that for even path contractions, total Betti numbers weakly decrease (Theorem 2.7), and in certain cases equality holds (Theorem 2.9). For edge contractions in graphs connected by an edge, the behavior is more delicate: examples exhibit both preservation and decrease, and Theorem 4.2 only guarantees β1 invariance.

This question seeks a general monotonicity principle for total Betti numbers under contracting the connecting edge in this special class of graphs.

References

Question 4.6. Let G be a graph connected by the edge e. Is βi(K[G]) ≥ βi(K[G e])?

Comparability of the total Betti numbers of toric ideals of graphs (2404.17836 - Favacchio, 27 Apr 2024) in Question 4.6, Section 4 (page ~15)