{"entities":{"Q5529188":{"pageid":7558748,"ns":120,"title":"Item:Q5529188","lastrevid":101405588,"modified":"2026-06-06T01:11:10Z","type":"item","id":"Q5529188","labels":{"en":{"language":"en","value":"Two theorems on the minimum number of intersections for complete graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3241875"}},"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":"Q5529188$AAA032F2-E7C7-4D20-801D-7E705B10F7C2","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6a898c19b0240fa30f90a4a9c21bd36de7dc6f1d","datavalue":{"value":{"text":"Two theorems on the minimum number of intersections for complete graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5529188$112A57A0-C9C6-4E60-B6CC-C6E24D9F4599","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"060197d9c440d4da10a216b62a98d2112cb776f0","datavalue":{"value":"0149.41303","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5529188$6A0E8226-9A81-43CC-B02C-FA4D62A655CD","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"4307f8e0692ba4d580235e67bfe060e5ca968944","datavalue":{"value":"10.1016/S0021-9800(67)80061-9","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5529188$9C4E664A-02F4-49F7-ABB0-9995284F4AA4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"cd9e8e772eda3826a2e65eac3da8e6f79b7b1424","datavalue":{"value":{"entity-type":"item","numeric-id":425252,"id":"Q425252"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5529188$ECB4B806-A5F3-4C2E-AA20-81F4A5748812","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"2a320074a4e9d140b582de7653dd3aa3bbba1e48","datavalue":{"value":{"entity-type":"item","numeric-id":113487,"id":"Q113487"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5529188$02C9248E-2F19-459B-B651-14CBCBFB69F0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d7d628e8c937a22d7d86104d43d6122808f1e938","datavalue":{"value":{"time":"+1967-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":"Q5529188$2D1288F8-C87E-4109-A8ED-55C6D158AC75","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"28750ab3127dd0eed27b9e4716dbb4e390bd5a1c","datavalue":{"value":"3241875","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5529188$47898B46-8C2C-487A-B3A0-D96225A40FA7","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"96a810129b114a6942442a7fc510c6873bd89ff8","datavalue":{"value":"topology","type":"string"},"datatype":"string"},"type":"statement","id":"Q5529188$85134E5F-AD16-4DE7-A68B-99934077601C","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":"Q5529188$FEB86CA6-6512-43E0-B69F-B440072705C6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Two theorems on the minimum number of intersections for complete graphs","badges":[]}}}}}