{"entities":{"Q6311494":{"pageid":13447444,"ns":120,"title":"Item:Q6311494","lastrevid":99198254,"modified":"2026-06-05T19:26:12Z","type":"item","id":"Q6311494","labels":{"en":{"language":"en","value":"The maximum number of triangles in graphs without large linear forests"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900367511"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6311494$1F6153CB-71CE-4F3A-9FAC-BC6AB045C14A","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6b3e8ce19e9f5978e8f566795e3d4c40e60d6b31","datavalue":{"value":{"time":"+2018-12-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6311494$CF5316D3-D1E1-4E5A-94F8-0EBC72285A14","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"bfbd078b3c5538137e679c6039bb47c1be506d7f","datavalue":{"value":{"entity-type":"item","numeric-id":2004082,"id":"Q2004082"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6311494$45EDA5A1-D06A-4261-87A6-095747657030","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f60415a064382a1c7586550b00669b53c7b75f57","datavalue":{"value":{"entity-type":"item","numeric-id":785798,"id":"Q785798"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6311494$A9DE9B10-54F8-4814-8261-47352C9EC342","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a25c67a89be63ae4e36da123916a2c6bdb97b420","datavalue":{"value":{"entity-type":"item","numeric-id":275754,"id":"Q275754"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6311494$35EFBC89-3B40-4DC1-BD04-CDC4EA7807F0","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"101e535b1bfc289cc999bacbf3a02fad0e47b8fb","datavalue":{"value":"900367511","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6311494$C39AE715-B8BB-40BA-898E-3083F40D67E3","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6311494$133E24D3-9EBF-49B0-92D7-F9CC368AF3EA","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The maximum number of triangles in graphs without large linear forests","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_maximum_number_of_triangles_in_graphs_without_large_linear_forests"}}}}}