The regularity of binomial edge ideals of graphs
In this paper, we study the Castelnuovo-Mumford regularity and the graded Betti numbers of the binomial edge ideals of some classes of graphs. Our special attention is devoted to a conjecture which asserts that the number of maximal cliques of a graph provides an upper bound for the regularity of it...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Amirkabir University of Technology
2020-09-01
|
| Series: | AUT Journal of Mathematics and Computing |
| Subjects: | |
| Online Access: | https://ajmc.aut.ac.ir/article_3929_b83d4acf2f2cd01f5b330abd203696c6.pdf |
| _version_ | 1797307129248350208 |
|---|---|
| author | Sara Saeedi Madani Dariush Kiani |
| author_facet | Sara Saeedi Madani Dariush Kiani |
| author_sort | Sara Saeedi Madani |
| collection | DOAJ |
| description | In this paper, we study the Castelnuovo-Mumford regularity and the graded Betti numbers of the binomial edge ideals of some classes of graphs. Our special attention is devoted to a conjecture which asserts that the number of maximal cliques of a graph provides an upper bound for the regularity of its binomial edge ideal. |
| first_indexed | 2024-03-08T00:51:49Z |
| format | Article |
| id | doaj.art-4faa38262a0242dd9e63aafd21a94d01 |
| institution | Directory Open Access Journal |
| issn | 2783-2449 2783-2287 |
| language | English |
| last_indexed | 2024-03-08T00:51:49Z |
| publishDate | 2020-09-01 |
| publisher | Amirkabir University of Technology |
| record_format | Article |
| series | AUT Journal of Mathematics and Computing |
| spelling | doaj.art-4faa38262a0242dd9e63aafd21a94d012024-02-14T19:35:59ZengAmirkabir University of TechnologyAUT Journal of Mathematics and Computing2783-24492783-22872020-09-011221722110.22060/ajmc.2020.16433.10243929The regularity of binomial edge ideals of graphsSara Saeedi Madani0Dariush Kiani1Faculty of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic),Tehran, IranFaculty of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic),Tehran, IranIn this paper, we study the Castelnuovo-Mumford regularity and the graded Betti numbers of the binomial edge ideals of some classes of graphs. Our special attention is devoted to a conjecture which asserts that the number of maximal cliques of a graph provides an upper bound for the regularity of its binomial edge ideal.https://ajmc.aut.ac.ir/article_3929_b83d4acf2f2cd01f5b330abd203696c6.pdfbinomial edge idealcastelnuovo-mumford regularityfree cut edge |
| spellingShingle | Sara Saeedi Madani Dariush Kiani The regularity of binomial edge ideals of graphs AUT Journal of Mathematics and Computing binomial edge ideal castelnuovo-mumford regularity free cut edge |
| title | The regularity of binomial edge ideals of graphs |
| title_full | The regularity of binomial edge ideals of graphs |
| title_fullStr | The regularity of binomial edge ideals of graphs |
| title_full_unstemmed | The regularity of binomial edge ideals of graphs |
| title_short | The regularity of binomial edge ideals of graphs |
| title_sort | regularity of binomial edge ideals of graphs |
| topic | binomial edge ideal castelnuovo-mumford regularity free cut edge |
| url | https://ajmc.aut.ac.ir/article_3929_b83d4acf2f2cd01f5b330abd203696c6.pdf |
| work_keys_str_mv | AT sarasaeedimadani theregularityofbinomialedgeidealsofgraphs AT dariushkiani theregularityofbinomialedgeidealsofgraphs AT sarasaeedimadani regularityofbinomialedgeidealsofgraphs AT dariushkiani regularityofbinomialedgeidealsofgraphs |