{"entities":{"Q1234299":{"pageid":1245049,"ns":120,"title":"Item:Q1234299","lastrevid":70380999,"modified":"2026-04-13T14:23:24Z","type":"item","id":"Q1234299","labels":{"en":{"language":"en","value":"An upper bound for the number of spanning trees of a graph"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3542454"}},"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":"Q1234299$D78BB16F-0152-42FE-942D-43F11E7C240F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c43e7d7825e504e1dee87a2e6656ad3d1bff3c98","datavalue":{"value":{"text":"An upper bound for the number of spanning trees of a graph","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1234299$65D151E0-45D9-4FB0-A222-137A4C1E8DBD","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c055aed104a90f7dbbd5a44159ffacbc5c9f48b9","datavalue":{"value":"0348.05106","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1234299$8057D319-B8F3-47C0-8CEF-1A4277A764E8","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"11db7c08afcfeea75c7b4fc9c755c81eb828220f","datavalue":{"value":"10.1016/S0012-365X(76)80005-2","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1234299$37C14B0B-819E-4DAA-9951-6131E1803753","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"38665fe4ed2b835132254a58832c329597060029","datavalue":{"value":{"entity-type":"item","numeric-id":175483,"id":"Q175483"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1234299$6649A059-197E-4919-9D76-BAF26B46BDA9","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a49472451190faf858f564fafd4bcba399999753","datavalue":{"value":{"time":"+1977-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1234299$9BAC8F5B-56C4-4AB4-BC5D-7BB185253323","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1234299$6970D300-B9B1-4517-BD64-8AA0CDE84025","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5da87a72c21717089feda882f568938059a9d84","datavalue":{"value":"05C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1234299$3337B111-B7A8-4F92-83D0-32A09BED97DE","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"06ff8b7b084eb0d82530e1cd0ff20a35ed7e1018","datavalue":{"value":"3542454","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1234299$FD3C4D8D-5CB4-4A2E-A8BB-9F571C1214AE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a7f7119d5407047e349351e6c0280b9bf47d5a63","datavalue":{"value":{"entity-type":"item","numeric-id":301808,"id":"Q301808"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1234299$8252E7D9-67DF-4A09-8E0B-2FB82E9ED650","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":"Q1234299$A0A9CF10-E47E-4FB4-8152-9E9DCEE76691","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"73065e1f99acfea60791aaa874a6b317e685fafe","datavalue":{"value":{"entity-type":"item","numeric-id":4770409,"id":"Q4770409"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1234299$3A8B9A2A-45C0-4F04-94DF-D88DB79E72E5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"8691ce0ca14717ab9e2af3b5294eb3e0c1171712","datavalue":{"value":{"entity-type":"item","numeric-id":4047574,"id":"Q4047574"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1234299$31CA6096-37D1-4025-8742-451AEB95473B","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"8c373e14d0ef5a605681ab5b22a8229dab2da6fb","datavalue":{"value":"https://doi.org/10.1016/s0012-365x(76)80005-2","type":"string"},"datatype":"url"},"type":"statement","id":"Q1234299$CE82F739-EA30-43DC-ABCA-F88A3C46887B","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"dafba276643391dca02d2e889e695d939f0caeb7","datavalue":{"value":"W1994224017","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1234299$A715B2BD-9CBC-4B0E-98B3-1338C65BCF96","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An upper bound for the number of spanning trees of a graph","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_upper_bound_for_the_number_of_spanning_trees_of_a_graph"}}}}}