{"entities":{"Q6993728":{"pageid":21465360,"ns":120,"title":"Item:Q6993728","lastrevid":83939456,"modified":"2026-05-07T14:47:52Z","type":"item","id":"Q6993728","labels":{"en":{"language":"en","value":"Large induced distance matchings in certain sparse random graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8030638"}},"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":"Q6993728$82C1F11E-0C4F-4D7F-8D53-D5CFA46C4DE2","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"74bbb0a2f0468dca599a493de1ae56b5a5f4260e","datavalue":{"value":{"text":"Large induced distance matchings in certain sparse random graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6993728$121877FD-6B79-4515-A9FF-ACBE89FE57A2","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8ba776a2a0a85f052410004402a73833557140e2","datavalue":{"value":"10.1007/S00373-025-02921-W","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6993728$5B79E377-3E44-4C33-B634-E9FFDDC22AB0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"150a7b8847bd9ad4b3edd373d55df32a3355d4d7","datavalue":{"value":{"entity-type":"item","numeric-id":413282,"id":"Q413282"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$8100C3C0-A2A7-4C1F-BF3D-0B1E96580A29","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c5e4575c1247b9e58e2619d396efa7107958229c","datavalue":{"value":{"entity-type":"item","numeric-id":526228,"id":"Q526228"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$09589D71-6115-427A-A28B-D1F83BE385DF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9521c88eb64207861d1b17949de98b98473c41f1","datavalue":{"value":{"entity-type":"item","numeric-id":413283,"id":"Q413283"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$C6FF55BC-494A-4C11-98FA-8B4A0F8E5247","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"62093226388c211ee4d5286124caf1fbc8b86437","datavalue":{"value":{"entity-type":"item","numeric-id":185060,"id":"Q185060"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$B9B1F807-C400-4F5D-B744-66D013A98C47","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"36d5abadbf07d23923c3e363e6676c69e633cc71","datavalue":{"value":{"time":"+2025-04-25T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6993728$B35F6736-F7BC-4E78-AD0B-3A03409F91F3","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"a486c618d9d111bc40aacfb6584d68031b736c92","datavalue":{"value":"Given a graph \\(G\\) and a distance \\(k\\), a set of edges \\(M_k \\subseteq E(G)\\) is said to form a distance \\(k\\)-matching if no two members of \\(M_k\\) are at distance at most \\(k\\) in \\(G\\).\\N\\NThe authors study the asymptotics of distance matchings in random graphs and more specifically, in graphs sampled from \\(\\mathbb{G}(n,C/n)\\), where \\(C>0\\) is some sufficiently large constant.\\N\\N\\textit{R. J. Kang} and \\textit{P. Manggala} [Discrete Appl. Math. 160, No. 16--17, 2435--2439 (2012; Zbl 1329.05111)] proved that given \\(k \\geq 2\\) a graph \\(G \\sim \\mathbb{G}(n,C/n)\\) asymptotically almost surely has the property that distance \\(k\\)-matchings have size at most \\(\\left(1+o(1) \\right)\\frac{kn \\log c}{2c^{k-1}}\\). For \\(k=2\\), \\textit{O. Cooley} et al. [SIAM J. Discrete Math. 35, No. 1, 267--280 (2021; Zbl 1459.05297)] proved that this bound is, in fact, tight. Here, the authors venture further and establish that \\(G \\sim \\mathbb{G}(n,C/n)\\) asymptotically almost surely has the property that distance \\(k\\)-matchings have size at least \\(\\left(1+o(1) \\right)\\frac{kn \\log c}{4c^{k-1}}\\), whenever \\(k \\geq 3\\).","type":"string"},"datatype":"string"},"type":"statement","id":"Q6993728$5BF0138F-4265-4F1A-9C0B-165D9BFFDE7C","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"4b2e2e70923f9ff6cebb5c100e6a716a73b6af5b","datavalue":{"value":{"entity-type":"item","numeric-id":271781,"id":"Q271781"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$3AFAFA42-D172-44F0-84E8-B601345629B0","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"4dd6b8847e09c706889ad9ef05dc0040f1c9f982","datavalue":{"value":"05C80","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6993728$A37F7451-B954-4C02-83BB-973695D36491","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"cf979f4acdc6dac710cfd0a80dde6754b28a9043","datavalue":{"value":"05C42","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6993728$7E0C1166-446E-4A25-BEF7-FD4FDFB4714B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6993728$93945A73-A4F3-4CA5-9D17-5FE5301A3502","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"625e55f1f2a96178239720bc1bbbe7ad21cf0a75","datavalue":{"value":"05C70","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6993728$9FB5E193-7347-4D63-B47A-8E8AA51ECA07","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a30f49db7448305d9ad830d5acd85ac59e75bac8","datavalue":{"value":"8030638","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6993728$4A9B80C9-7CE5-498B-913F-713415CB00AC","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"eb0d756bd5d5443176dea778a5cff50b6c950028","datavalue":{"value":"induced matchings","type":"string"},"datatype":"string"},"type":"statement","id":"Q6993728$0F27FD93-2B81-4A08-9C8A-1D2716461766","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9fbab46d6b5ab96d1c51de64c7330e3d8cd3d1fa","datavalue":{"value":"distance matchings","type":"string"},"datatype":"string"},"type":"statement","id":"Q6993728$7548B0C0-51E7-484E-8501-6BE784CF69B8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8773009372ada8b5ee77edb73206b62f8d2d70b6","datavalue":{"value":"strong chromatic index","type":"string"},"datatype":"string"},"type":"statement","id":"Q6993728$F352523D-1241-4AF0-8981-BB6CA82B63D3","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":"Q6993728$C45EABD2-A200-4AA0-809D-399BB7274AD7","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"b2758f48b1a93e71d851a0e4b14bce521c35fc05","datavalue":{"value":{"entity-type":"item","numeric-id":3503433,"id":"Q3503433"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$ECE36F45-B440-42E1-A1F6-713C2B825A36","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"55f40720899f5b124da6b573e677ed96f208cc49","datavalue":{"value":{"entity-type":"item","numeric-id":1262877,"id":"Q1262877"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$6E0F8F86-A500-4715-BEFF-2D7DC7884367","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"040f94e316e35dcc8ffc7f142de2c90ce9bfde4b","datavalue":{"value":{"entity-type":"item","numeric-id":2760456,"id":"Q2760456"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$E2D15CBE-2EA5-469C-9C22-CB76E96DCA73","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"c610dff5c07f70cf19f44b5d9c41deba6d599f1e","datavalue":{"value":{"entity-type":"item","numeric-id":5854458,"id":"Q5854458"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$5306AB3E-467E-47D7-8346-367B5154F3DB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"afd59815ac312b0e568dbc572b920e23e50a9eae","datavalue":{"value":{"entity-type":"item","numeric-id":1827703,"id":"Q1827703"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$DC3671C1-3C2E-4B4A-B1FE-FE668EE6868C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"09d3b2fff4c03e4d10c29b101a1724a90dda3a4d","datavalue":{"value":{"entity-type":"item","numeric-id":4325283,"id":"Q4325283"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$3617F2F5-CDBF-4966-A85D-B4F8BDD6A44F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"9c5f61d576e6fe41134cb1aa3dbe784029bbc8fa","datavalue":{"value":{"entity-type":"item","numeric-id":5470789,"id":"Q5470789"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$45971C9B-7685-461E-844E-8F9CB67DE267","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7c82227f6867eb77011dbe21ba5be9c199c6499f","datavalue":{"value":{"entity-type":"item","numeric-id":4979850,"id":"Q4979850"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$A6502AC7-3971-457C-A5E0-EB3B0404399D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ad5dc2f7bfcb2460eadef23e8742269c4876bc08","datavalue":{"value":{"entity-type":"item","numeric-id":5414148,"id":"Q5414148"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$564B8957-85ED-4E7A-B087-9002A3F6AD23","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"1439efc157c6993b0d83fcafe3bf7eac920bacba","datavalue":{"value":{"entity-type":"item","numeric-id":714033,"id":"Q714033"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$1AE0E43F-BB54-4B21-9029-C81FFCA4CA4F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"e71904b3e9963c768e4870dcb6f6abe896b90b6d","datavalue":{"value":{"entity-type":"item","numeric-id":4687761,"id":"Q4687761"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$338B4AE5-572C-47C7-B85D-30F55D4515A7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"44ec923cbd4ada2da601a0a5b3b7788ba08777d5","datavalue":{"value":{"entity-type":"item","numeric-id":294535,"id":"Q294535"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6993728$13A40BB9-87A6-4EB0-8C35-5DC8BD1A40BF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Large induced distance matchings in certain sparse random graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Large_induced_distance_matchings_in_certain_sparse_random_graphs"}}}}}