关于完全图零和完美匹配的存在性

Ars Math. Contemp. Pub Date : 2020-11-02 DOI:10.26493/1855-3974.2573.90d

Teeradej Kittipassorn, Panon Sinsap

{"title":"关于完全图零和完美匹配的存在性","authors":"Teeradej Kittipassorn, Panon Sinsap","doi":"10.26493/1855-3974.2573.90d","DOIUrl":null,"url":null,"abstract":"In this paper, we prove that given a 2-edge-coloured complete graph $K_{4n}$ that has the same number of edges of each colour, we can always find a perfect matching with an equal number of edges of each colour. This solves a problem posed by Caro, Hansberg, Lauri, and Zarb. The problem is also independently solved by Ehard, Mohr, and Rautenbach.","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"On the existence of zero-sum perfect matchings of complete graphs\",\"authors\":\"Teeradej Kittipassorn, Panon Sinsap\",\"doi\":\"10.26493/1855-3974.2573.90d\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we prove that given a 2-edge-coloured complete graph $K_{4n}$ that has the same number of edges of each colour, we can always find a perfect matching with an equal number of edges of each colour. This solves a problem posed by Caro, Hansberg, Lauri, and Zarb. The problem is also independently solved by Ehard, Mohr, and Rautenbach.\",\"PeriodicalId\":8402,\"journal\":{\"name\":\"Ars Math. Contemp.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ars Math. Contemp.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26493/1855-3974.2573.90d\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ars Math. Contemp.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26493/1855-3974.2573.90d","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

本文证明了给定两边彩色完全图$K_{4n}$，每种颜色的边数相同，我们总能找到每种颜色的边数相等的完美匹配。这解决了Caro、Hansberg、Lauri和Zarb提出的问题。Ehard, Mohr和Rautenbach也独立地解决了这个问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

On the existence of zero-sum perfect matchings of complete graphs

In this paper, we prove that given a 2-edge-coloured complete graph $K_{4n}$ that has the same number of edges of each colour, we can always find a perfect matching with an equal number of edges of each colour. This solves a problem posed by Caro, Hansberg, Lauri, and Zarb. The problem is also independently solved by Ehard, Mohr, and Rautenbach.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Ars Math. Contemp.

自引率

0.00%

发文量

期刊最新文献

Enumerating symmetric pyramids in Motzkin paths A classification of connected cubic vertex-transitive bi-Cayley graphs over semidihedral group Almost simple groups as flag-transitive automorphism groups of symmetric designs with λ prime Component (edge) connectivity of pancake graphs On girth-biregular graphs