{"entities":{"Q577965":{"pageid":579732,"ns":120,"title":"Item:Q577965","lastrevid":62906334,"modified":"2026-04-11T08:56:16Z","type":"item","id":"Q577965","labels":{"en":{"language":"en","value":"Graphen und Matrices."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2560680"}},"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":"Q577965$81D43D41-185E-417B-8B7A-9EEC15D02C68","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"2440b23162522d0ff59c13df49eb4811acd72ebb","datavalue":{"value":{"text":"Graphen und Matrices.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q577965$6C010153-1723-47AF-B227-628DE081D76B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"edb09fce03dc447c4a1dc338eec790451514858c","datavalue":{"value":"57.1340.04","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q577965$7C219900-603F-409D-924D-2F41E67A1954","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"eae60a4ef1761ab9a2c91187277eb65def923cc2","datavalue":{"value":{"entity-type":"item","numeric-id":563080,"id":"Q563080"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q577965$30383C45-1A6F-4D6C-AD72-85A103C94FE2","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e0130902a9dcdeca58c7452ef77c67f7d7741a88","datavalue":{"value":{"time":"+1931-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":"Q577965$423EA13C-B90A-4201-8700-E2A91F268957","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"01e4b48472800d4f879559eef250890dc37da11e","datavalue":{"value":"Es wird der folgende Satz bewiesen: F\u00fcr jeden paaren Graphen (jede geschlossene Linie des Graphes hat eine gerade Anzahl von Kanten) ist die Minimalzahl derjenigen Knotenpunkte, welche die Kanten des Graphes ersch\u00f6pfen, gleich der Maximalzahl von Kanten, welche paarweise keinen gemeinsamen Endpunkt besitzen. Die Knotenpunkte \\(P_1\\), \\(P_2\\),\\dots, \\(P_\\nu\\) eines Graphen ersch\u00f6pfen die Kanten, wenn jede Kante in einem der Punkte \\(P_i\\,(i = 1, 2,\\dots, \\nu)\\) endet. Man kann den Satz in die Sprache der Matrices \u00fcbersetzen (vgl. in dem vorangehenden Referat den Satz von \\textit{Egerv\u00e1ry} im Falle \\(a_{ij} = 1, 0\\)). (V 2.)","type":"string"},"datatype":"string"},"type":"statement","id":"Q577965$C1EC5698-2AA7-4B29-BDA4-83CB9FCB7725","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2183241c71cdb15a4b22f5dc92ebac77b9ac3716","datavalue":{"value":"2560680","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q577965$972E05DA-1694-48CF-8B69-029D71EAA9CB","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":"Q577965$03F70091-A78C-489C-B878-F45D0D5EBCB4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"26bfc6afa9781f5b5c486cf32a5982dd749919f3","datavalue":{"value":{"entity-type":"item","numeric-id":6482848,"id":"Q6482848"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q577965$10DBAE6F-7B48-4C2E-B360-037AC9590FC2","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Graphen und Matrices.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Graphen_und_Matrices."}}}}}