{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1277205","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1277205","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1277205","kernelVersion":"v1","immutable":true,"modified":"2025-12-25T05:36:07Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1277205","name":"Koszul bipartite graphs","headline":"Koszul bipartite graphs","description":"scientific article; zbMATH DE number 1247939","url":"https://portal.mardi4nfdi.de/entity/Q1277205","datePublished":"1999-04-11","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q255671"},{"@id":"https://portal.mardi4nfdi.de/entity/Q249579"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q103557"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1006/AAMA.1998.0615","url":"https://doi.org/10.1006/AAMA.1998.0615"},"sameAs":["https://doi.org/10.1006/AAMA.1998.0615"],"comment":"Let \\(R = K[t_1, \\ldots , t_d]\\) be the polynomial ring in \\(d\\) indeterminates over a field \\(K\\). If \\(G\\) is a bipartite graph on the vertex set \\(\\{ 1, \\ldots , d \\}\\), define \\(K[G]\\) to be the subalgebra of \\(R\\) generated by all monomials \\(t_i t_j\\) such that \\(\\{ i,j \\}\\) is an edge of \\(G\\). It is shown that if every \\(n\\)-cycle \\((n \\geq 6)\\) has a chord, then \\(K[G]\\) is Koszul.","citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3708148"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4245145"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1306900"}]},"provenance":{"prov:generatedAtTime":"2025-12-25T05:36:07Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}