{"entities":{"Q6458166":{"pageid":13591168,"ns":120,"title":"Item:Q6458166","lastrevid":103450178,"modified":"2026-06-06T07:23:25Z","type":"item","id":"Q6458166","labels":{"en":{"language":"en","value":"Tight upper bound on the clique size in the square of 2-degenerate graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 902359418"}},"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":"Q6458166$C4C5227C-AEEE-42A7-AEF1-7F6129CDBA78","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"25f74c91ff29d1adfbaf8036146a4606055f8b20","datavalue":{"value":{"time":"+2023-11-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6458166$F948CAC1-1F78-4C13-89CE-287B9D5D4837","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0b48b29245211a43e7ec7c0efd3d89fdac7d83f0","datavalue":{"value":{"entity-type":"item","numeric-id":345120,"id":"Q345120"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6458166$4EE2AB8D-DAF9-4E27-8F94-819C0ADC3DD4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"78de1431a255ccb7ac36c72594dd920de6ebb057","datavalue":{"value":{"entity-type":"item","numeric-id":2095565,"id":"Q2095565"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6458166$903400CF-3490-4F83-B503-A579EB399D5C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"46792fda10cba94fed93203ae540b7fb4af41a34","datavalue":{"value":"902359418","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6458166$4294F5B9-38B5-46FA-94DB-8B855F3B627C","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":"Q6458166$5FCEDB2C-762D-4D0D-8457-4AACF0470A9B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Tight upper bound on the clique size in the square of 2-degenerate graphs (scientific article; zbMATH DE number 902359418)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Tight_upper_bound_on_the_clique_size_in_the_square_of_2-degenerate_graphs_(scientific_article;_zbMATH_DE_number_902359418)"}}}}}