• 1
  • 2
  • 5
  • 6
  • 7
  • 8
  • 9
  • 3
  • 4
IPM
30
YEARS OLD

“School of Mathematics”

Back to Papers Home
Back to Papers of School of Mathematics

Paper   IPM / M / 16038
School of Mathematics
  Title:   Induced matchings in strongly biconvex graphs and some algebraic applications
  Author(s): 
1.  Sara Saeedi Madani
2.  Dariush Kiani
  Status:   To Appear
  Journal: Math. Nachr.
  Supported by:  IPM
  Abstract:
In this paper, motivated by a question posed by de Alba and Hoang, we introduce strongly biconvex graphs as a subclass of weakly chordal and bipartite graphs. We give a linear time algorithm to find an induced matching for such graphs and we prove that this algorithm indeed gives a maximum induced matching. Applying this algorithm, we provide a strongly biconvex graph whose (monomial) edge ideal does not admit a unique extremal Betti number. Using this constructed graph, we provide an infinite family of the so-called closed graphs (also known as proper interval graphs) whose binomial edge ideals do not have a unique extremal Betti number. This, in particular, answers the aforementioned question.

Download TeX format
back to top
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
scroll left or right