{"entities":{"Q1010866":{"pageid":1012714,"ns":120,"title":"Item:Q1010866","lastrevid":66595467,"modified":"2026-04-12T11:11:12Z","type":"item","id":"Q1010866","labels":{"en":{"language":"en","value":"Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5541036"}},"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":"Q1010866$A739DC46-2043-4B06-B75F-F431C345EF63","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"9d69db32294fc34a789ec2dbe83af6fbd2de3033","datavalue":{"value":{"text":"Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1010866$BDB7107E-F8C4-4682-AFE4-1662E70A9220","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"e14e9cf98633f5e6794af7eb8737066a72eaf0a1","datavalue":{"value":"1165.05319","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1010866$8CFED7B5-84A0-4EDA-9938-89DFFCE40060","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e260fddb15a6ce5697896832168b9cc6a37bb82c","datavalue":{"value":{"entity-type":"item","numeric-id":932697,"id":"Q932697"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1010866$8147E071-EC7D-4A1B-8DE1-F3F52A6213E3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2bf6b57361b3180efb360b271887d95e01377385","datavalue":{"value":{"entity-type":"item","numeric-id":831023,"id":"Q831023"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1010866$04648627-CD4F-4770-9C14-07B477F31C76","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"ebc7441ecfd9ecfa38d48ddc4b2adb39ac7d7000","datavalue":{"value":{"entity-type":"item","numeric-id":161296,"id":"Q161296"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1010866$0F144AEA-6A9D-4C41-9519-7BFC996ADB52","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f584a175cfc2fafdfc362244f176e06010bbf381","datavalue":{"value":{"time":"+2009-04-07T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1010866$E8C2D313-311D-41AD-8A07-D548E4201028","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"3daca1f3ca0444eacb343d094a4f9699354b3266","datavalue":{"value":"https://arxiv.org/abs/0801.0270","type":"string"},"datatype":"url"},"type":"statement","id":"Q1010866$EBE691C5-8F49-4590-B4DA-CE473C2803A7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P205","hash":"70b6dd742d63a8bec79fdde49950df0846299a19","datavalue":{"value":"https://eudml.org/doc/130280","type":"string"},"datatype":"url"},"type":"statement","id":"Q1010866$A0C80A89-BAB3-457B-92F7-65A4DBFC0160","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P205","hash":"84e8764974d57ef7079f704baead3bab8f3de10f","datavalue":{"value":"http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r131.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q1010866$FD4C85AA-27D6-4F96-9E72-E245659F1EFB","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"27628806d40bd0fe31e47671e16935b3123251c5","datavalue":{"value":"Summary: The monochromatic tree partition number of an \\(r\\)-edge-colored graph \\(G\\), denoted by \\(t_r(G)\\), is the minimum integer \\(k\\) such that whenever the edges of \\(G\\) are colored with \\(r\\) colors, the vertices of \\(G\\) can be covered by at most \\(k\\) vertex-disjoint monochromatic trees. In general, to determine this number is very difficult. For 2-edge-colored complete multipartite graph, Kaneko, Kano, and Suzuki gave the exact value of \\(t_2(K(n_1,n_2,\\dots,n_k))\\). In this paper, we prove that if \\(n\\geq 3\\), and \\(K(n,n)\\) is 3-edge-colored such that every vertex has color degree 3, then \\(t_3(K(n,n))=3\\).","type":"string"},"datatype":"string"},"type":"statement","id":"Q1010866$CD0CC764-BD21-4E3B-8C67-AADDBD56EDFF","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5da87a72c21717089feda882f568938059a9d84","datavalue":{"value":"05C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1010866$9446F28C-5575-43F0-82CC-E39974B8737A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f15d46cb8d4ffe0dbd9357e013b784d0f700114","datavalue":{"value":"05C15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1010866$EF54BDE2-4A20-470C-BA8B-6D5FC0A6163C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"625e55f1f2a96178239720bc1bbbe7ad21cf0a75","datavalue":{"value":"05C70","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1010866$540DEAAD-A856-4AB9-847E-67782B693A02","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1010866$F8FBC2AE-5C5F-4C86-B272-C8CCF5489E49","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9182a922d01fa91d3fdf405939619d86a6d726e2","datavalue":{"value":"5541036","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1010866$E125C95D-E3A6-447D-ADCC-3A9E7D9E87E2","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a88a0ba2c599b03153bef27196cfadd52d216cdf","datavalue":{"value":"monochromatic tree partition","type":"string"},"datatype":"string"},"type":"statement","id":"Q1010866$F1B5A7B8-1E1E-4833-A2C6-14A9433D11B9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bb3a7c06b77ac3ac3316392c3c1e89c611dd1fea","datavalue":{"value":"edge colored graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q1010866$CAD1572D-908C-4607-9747-4462C639D693","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"20af77082a7a46759b17e0b5fea2d1c1d8af18f3","datavalue":{"value":"verwx disjoint monochromatic trees","type":"string"},"datatype":"string"},"type":"statement","id":"Q1010866$BE8A2487-A1E7-4385-9CA0-904EFC768846","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"95315580a488697753f314bcf92d6e8b4a36f135","datavalue":{"value":"vertex covering","type":"string"},"datatype":"string"},"type":"statement","id":"Q1010866$A15DCE53-670E-44D0-8B95-09D9BF7436DA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fd1fb65456039f265c37ca93de5a6ce33eabd302","datavalue":{"value":"multipartite graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q1010866$612F9175-FA76-4121-BC0B-D305C4BF43FA","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":"Q1010866$0384FC4D-0805-47FB-8CA9-B28061DB3C5A","rank":"normal"}],"P1633":[{"mainsnak":{"snaktype":"value","property":"P1633","hash":"1195937d97934c04c66fa8b5d200fd6731fd2805","datavalue":{"value":"bafkreic6cijaz4owokjf7im7k7hfkppaie22jx7kxprwoy537hg3uis73a","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1010866$A0AB587E-86A2-45FB-A8F5-3A0AC6C816E2","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5ad996097d9d9d2df7d954a29775abf17a3b4f5b","datavalue":{"value":{"entity-type":"item","numeric-id":4667794,"id":"Q4667794"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"89f1568e2a1fb5ef5ace0ec7a6e8072d021d092c","datavalue":{"value":{"amount":"+0.8976176977157593","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1010866$514A577B-130F-4D36-81AF-FC0237387795","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"cd7105c03f1dd9c1059ee60fc92fc68939515b32","datavalue":{"value":{"entity-type":"item","numeric-id":2898721,"id":"Q2898721"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"dac2d4a99b5a52a3f66e782fd96c92bba54e68ac","datavalue":{"value":{"amount":"+0.8938148617744446","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1010866$0A612D00-87BC-40C1-A982-EE49F80A82BC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f1c5d92cd553bd9109c39fae554448c26e8347e4","datavalue":{"value":{"entity-type":"item","numeric-id":1125948,"id":"Q1125948"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"650e2d96de9bdd5fb58a910edfde4f390bb2deaf","datavalue":{"value":{"amount":"+0.8586304187774658","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1010866$0E4509EE-463E-4F2E-9CF4-FB7F5011EDE1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5d3e29671419fe61bf170c30bd67bed230ee16d6","datavalue":{"value":{"entity-type":"item","numeric-id":540032,"id":"Q540032"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"0baee9007dcf5d06583de94ddcc54f372aa08575","datavalue":{"value":{"amount":"+0.8581946492195129","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1010866$53E8A366-77AD-4F33-85FA-8B25E8A62738","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"79de44e6017a2f3112b8281342d40c6adb44dba6","datavalue":{"value":{"entity-type":"item","numeric-id":324372,"id":"Q324372"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"923c3e11c34482ebed64342c072db04569296cbd","datavalue":{"value":{"amount":"+0.8567666411399841","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1010866$83B6B942-567A-4D0E-A498-8F0C9838365B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Partitioning_3-edge-colored_complete_equi-bipartite_graphs_by_monochromatic_trees_under_a_color_degree_condition"}}}}}