Rainbow matchings in k‐partite hypergraphs
2020; Wiley; Volume: 53; Issue: 2 Linguagem: Inglês
10.1112/blms.12423
ISSN1469-2120
AutoresSergei Kiselev, Andrey Kupavskii,
Tópico(s)Graph theory and applications
ResumoBulletin of the London Mathematical SocietyVolume 53, Issue 2 p. 360-369 Research Article Rainbow matchings in k-partite hypergraphs Sergei Kiselev, Sergei Kiselev kiselev.sg@gmail.com Laboratory of Combinatorial and Geometric Structures, MIPT, 9 Institutskiy per., Dolgoprudny, 141701 Russian FederationSearch for more papers by this authorAndrey Kupavskii, Corresponding Author Andrey Kupavskii kupavskii@ya.ru Laboratory of Combinatorial and Geometric Structures, MIPT, 9 Institutskiy per., Dolgoprudny, 141701 Russian Federation Laboratoire G-SCOP, CNRS, Univ. Grenoble-Alpes, 46 Avenue Félix Viallet, Grenoble, France IAS Princeton, 1 Einstein Drive, Princeton, NJ, USA kupavskii@ya.ruSearch for more papers by this author Sergei Kiselev, Sergei Kiselev kiselev.sg@gmail.com Laboratory of Combinatorial and Geometric Structures, MIPT, 9 Institutskiy per., Dolgoprudny, 141701 Russian FederationSearch for more papers by this authorAndrey Kupavskii, Corresponding Author Andrey Kupavskii kupavskii@ya.ru Laboratory of Combinatorial and Geometric Structures, MIPT, 9 Institutskiy per., Dolgoprudny, 141701 Russian Federation Laboratoire G-SCOP, CNRS, Univ. Grenoble-Alpes, 46 Avenue Félix Viallet, Grenoble, France IAS Princeton, 1 Einstein Drive, Princeton, NJ, USA kupavskii@ya.ruSearch for more papers by this author First published: 13 October 2020 https://doi.org/10.1112/blms.12423Citations: 2 The authors acknowledge the financial support from the Ministry of Education and Science of the Russian Federation in the framework of MegaGrant no 075-15-2019-1926. The research of the second author was directly supported by the IAS Fund for Math, the Director's Fund and indirectly supported by the National Science Foundation Grant No. CCF-1900460. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation Read the full textAboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinked InRedditWechat Abstract In this paper, we prove a conjecture of Aharoni and Howard on the existence of rainbow (transversal) matchings in sufficiently large families F 1 , … , F s of tuples in { 1 , … , n } k , provided s ⩾ 470 . Citing Literature Volume53, Issue2April 2021Pages 360-369 RelatedInformation
Referência(s)