{"entities":{"Q6933600":{"pageid":21105127,"ns":120,"title":"Item:Q6933600","lastrevid":75836257,"modified":"2026-04-21T05:15:41Z","type":"item","id":"Q6933600","labels":{"en":{"language":"en","value":"Packing large balanced trees into bipartite graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8090023"}},"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":"Q6933600$BFFB95FA-ADB4-415A-A451-C13E8D90E557","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"809d5c418fb697e28e225cea7e582c6a4d85d610","datavalue":{"value":{"text":"Packing large balanced trees into bipartite graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6933600$99FD8DB7-AE77-4E8E-8FF0-4CDC4AE86B36","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8ddcad85bd25d9165ea115ae6ef17827197a007a","datavalue":{"value":"10.1016/J.DISC.2025.114641","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6933600$598B45AA-3ED8-49DB-89C1-557FB785CCF4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"71bdaae01673fd4746ec8b438e9fb124ceb0698c","datavalue":{"value":{"entity-type":"item","numeric-id":299052,"id":"Q299052"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6933600$3CAFA992-5666-4375-8DB9-E8982F0D2534","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"caf0bd54f257fe831f949242b57417e229c1c5e1","datavalue":{"value":{"entity-type":"item","numeric-id":2132399,"id":"Q2132399"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6933600$B19EEC82-F17F-4054-A6DF-2DC188A8465B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a971332b10408127ab994b81722dcea9148cef5d","datavalue":{"value":{"entity-type":"item","numeric-id":6749229,"id":"Q6749229"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6933600$1EE05284-4916-49D6-9BED-E24BB8489E24","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"97fb358c2079ff26884faa70254e10e1c7b11f8b","datavalue":{"value":{"entity-type":"item","numeric-id":1010833,"id":"Q1010833"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6933600$450EC084-6424-44C3-9198-A63824C4A837","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":"Q6933600$7C0B5D00-CE5A-4958-94F0-FA5C413D8700","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a23ddb6e2c70fd9ec00b14fd0d47d45878ed5a45","datavalue":{"value":{"time":"+2025-09-04T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6933600$7AAC69F7-83D2-4731-9BB9-1108C8FCBDA2","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"ed3c145320c3dc875486f3d940c22e0fd6aa4da8","datavalue":{"value":"A family \\(\\mathcal{H}\\) of graphs packs into a graph \\(G\\) if \\(G\\) contains pairwise edge-disjoint copies of all the members of \\(\\mathcal{H}\\). The authors prove hat for every \\(\\gamma > 0 \\) there exists \\(n_0\\in \\mathbb{N}\\) such that for every \\( n\\geq n_0 \\) any family of up to \\(n^{1/2-\\gamma}\\) trees having at most \\((1-\\gamma)n\\) vertices in each bipartition class can be packed into \\(K_{n,n}\\). They also show an approximate bipartite version of the Koml\u00f3s-S\u00e1rk\u00f6zy-Szemer\u00e9di theorem.","type":"string"},"datatype":"string"},"type":"statement","id":"Q6933600$890EC9C4-1168-4758-997D-EC89E7C10AA9","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"00ad7a18ab86f9653d9355ac372830b882a09063","datavalue":{"value":{"entity-type":"item","numeric-id":295271,"id":"Q295271"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6933600$E89373AC-F5EF-4737-8C0A-11381EA436C7","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"625e55f1f2a96178239720bc1bbbe7ad21cf0a75","datavalue":{"value":"05C70","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6933600$543851F9-691B-489F-AF86-360799F62B92","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5da87a72c21717089feda882f568938059a9d84","datavalue":{"value":"05C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6933600$6964FE88-ED61-42F8-84D6-87BBD48CAAA7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"2fd5ba61c492f09082ae88370fa92e256be14e94","datavalue":{"value":"05C75","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6933600$AC7F67FA-CEB9-4A8E-A8E4-4CC5A0D9E1A6","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"35d1a60fe72923a1603708482faca64fda684c32","datavalue":{"value":"8090023","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6933600$C7A81C75-D651-4DDA-BF90-7A4E16C51FAE","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"eb8ebf8be6049e7037e6e37fdeaa648f17fdda8f","datavalue":{"value":"tree packing","type":"string"},"datatype":"string"},"type":"statement","id":"Q6933600$238B1696-600B-4BB8-9C58-EB8DB2463BF3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cee46e2c6a42a74803d50f6329947494bb4a53f6","datavalue":{"value":"graph decomposition","type":"string"},"datatype":"string"},"type":"statement","id":"Q6933600$0D5E4B15-0CE9-40C5-A346-1BCC06784A61","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f864626b47de03bc550dfb512336687f3eaf0bee","datavalue":{"value":"balanced trees","type":"string"},"datatype":"string"},"type":"statement","id":"Q6933600$93CC8075-E0C0-40F8-A216-8B5104C2E1FE","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":"Q6933600$45FF887E-073B-4191-9492-6FB0EEE5DF8F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Packing large balanced trees into bipartite graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Packing_large_balanced_trees_into_bipartite_graphs"}}}}}