{"@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/Q5564136","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q5564136","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q5564136","kernelVersion":"v1","immutable":true,"modified":"2026-01-05T12:01:27Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q5564136","name":"On the number of complete subgraphs and circuits contained in graphs","headline":"On the number of complete subgraphs and circuits contained in graphs","description":"scientific article; zbMATH DE number 3284077","url":"https://portal.mardi4nfdi.de/entity/Q5564136","datePublished":"1969-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q6480801"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.21136/CPM.1969.108598","url":"https://doi.org/10.21136/CPM.1969.108598"},"sameAs":["https://doi.org/10.21136/CPM.1969.108598"]},"provenance":{"prov:generatedAtTime":"2026-01-05T12:01:27Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}