IDEAS home Printed from https://ideas.repec.org/a/bla/mathna/v294y2021i6p1160-1174.html
   My bibliography  Save this article

Induced matchings in strongly biconvex graphs and some algebraic applications

Author

Listed:
  • Sara Saeedi Madani
  • Dariush Kiani

Abstract

In this paper, motivated by a question posed by H. de Alba and D. T. 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.

Suggested Citation

  • Sara Saeedi Madani & Dariush Kiani, 2021. "Induced matchings in strongly biconvex graphs and some algebraic applications," Mathematische Nachrichten, Wiley Blackwell, vol. 294(6), pages 1160-1174, June.
    • Handle: RePEc:bla:mathna:v:294:y:2021:i:6:p:1160-1174
    DOI: 10.1002/mana.201900472
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/mana.201900472
    Download Restriction: no
    File URL: https://libkey.io/10.1002/mana.201900472?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Hernán de Alba & Do Trong Hoang, 2018. "On the extremal Betti numbers of the binomial edge ideal of closed graphs," Mathematische Nachrichten, Wiley Blackwell, vol. 291(1), pages 28-40, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. René González‐Martínez, 2021. "Gorenstein binomial edge ideals," Mathematische Nachrichten, Wiley Blackwell, vol. 294(10), pages 1889-1898, October.
    2. Arvind Kumar & Rajib Sarkar, 2020. "Depth and extremal Betti number of binomial edge ideals," Mathematische Nachrichten, Wiley Blackwell, vol. 293(9), pages 1746-1761, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:mathna:v:294:y:2021:i:6:p:1160-1174. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0025-584X .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.