{"entities":{"Q3184548":{"pageid":3195256,"ns":120,"title":"Item:Q3184548","lastrevid":80030738,"modified":"2026-05-06T15:16:55Z","type":"item","id":"Q3184548","labels":{"en":{"language":"en","value":"A simple upper bound for the number of spanning trees of regular graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5618987"}},"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":"Q3184548$16B78556-67A4-43CE-AA37-09AD4862065D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f7e6e00014132d3e3f26957c652d17efa4d0f876","datavalue":{"value":{"text":"A simple upper bound for the number of spanning trees of regular graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3184548$82D32A5D-0691-49C7-9DD7-525A86D678FF","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"07643732d4de92b97698bde2d7fdf87dcfa18ae2","datavalue":{"value":"1171.05347","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3184548$0098BA67-B4F9-4482-A02C-79700A815659","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7cb93412e1327224d2f9f419acc0fa4488f60f03","datavalue":{"value":"10.1515/DMA.2008.026","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3184548$0C0DB861-5C47-4E24-9582-567186C03705","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"3d82c5188b0ddafa3f3991a7a06ab8754aab0c2b","datavalue":{"value":{"entity-type":"item","numeric-id":314121,"id":"Q314121"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3184548$F42EB734-FCDA-4229-9889-ADFCCB796B69","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"585d1b6b99d27f199c0f368625ea84cb624d6f9c","datavalue":{"value":{"time":"+2009-10-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":"Q3184548$3583A166-E847-4F56-B3C1-83304EED7BFA","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3184548$371A8097-6D78-4A5C-B5D2-CC2784DC2C29","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1de0493fc6f7fe4361a54e7c2f5546e4ec52adf0","datavalue":{"value":"05C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3184548$750E781E-4812-4161-AC35-E810CE9B9050","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5da87a72c21717089feda882f568938059a9d84","datavalue":{"value":"05C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3184548$48B5E29F-72BB-47E3-B3A4-9D4B3CABD6B7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a96ec907efed235a35d59487f92867c324de23ce","datavalue":{"value":"5618987","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3184548$4B72E022-1191-45F5-8D2F-504B073065B9","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":"Q3184548$6A15E7FB-59CE-4D5B-A190-DDB097F8DE18","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"926e9805a0ab0fd3215d1397a86c1cbd3b2c00bd","datavalue":{"value":{"entity-type":"item","numeric-id":1917322,"id":"Q1917322"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3184548$54701A50-53E8-4DB5-BBFE-59AFBFCD6431","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"34dad4909b4eaf3432ec13faf5c2cd9e595729ec","datavalue":{"value":"https://doi.org/10.1515/dma.2008.026","type":"string"},"datatype":"url"},"type":"statement","id":"Q3184548$FB0DC18B-394C-4D2A-9780-4B5C80C2C16C","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"a9147d8e4cfdb78383353fe96285a7bdd1c55e7c","datavalue":{"value":"W2066491477","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3184548$DB6B80E5-A7BA-421C-9509-2C02D1E5F139","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A simple upper bound for the number of spanning trees of regular graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_simple_upper_bound_for_the_number_of_spanning_trees_of_regular_graphs"}}}}}