Chordal bipartite graphs, biclique vertex partitions and Castelnuovo-Mumford regularity of $1$-subdivision graphs
Yusuf Civan, Zakir Deniz, Oleg Duginov, Mehmet Akif Yetim

TL;DR
This paper investigates the Castelnuovo-Mumford regularity of 1-subdivision graphs, establishing bounds related to biclique partitions and characterizing the topological structure of their independence complexes.
Contribution
It proves a lower bound on regularity in terms of biclique partition number and characterizes when equality holds for chordal bipartite graphs, also analyzing their independence complexes.
Findings
Proves that reg(S(G)) ≥ |G| - bp(G) for all graphs G.
Shows equality reg(S(B)) = |B| - bp(B) for chordal bipartite graphs B.
Classifies the homotopy type of the independence complex of S(B) as either contractible or a sphere.
Abstract
A biclique in a graph is a complete bipartite subgraph (not necessarily induced), and the least positive integer for which the vertex set of can be partitioned into at most bicliques is the biclique vertex partition number of . We prove that the inequality holds for every graph , where is the -subdivision graph of and denotes the (Castelnuovo-Mumford) regularity of the graph . In particular, we show that the equality holds provided that is a chordal bipartite graph. Furthermore, for every chordal bipartite graph , we prove that the independence complex of is either contractible or homotopy equivalent to a sphere, and provide a polynomial time checkable criteria for when it is contractible, and describe the dimension of the sphere when it is not.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Graph theory and applications · Algebraic structures and combinatorial models
