Work

Rainbow matchings in k‐partite hypergraphs

Year: 2020

Type: article

Abstract: In this paper, we prove a conjecture of Aharoni and Howard on the existence of rainbow (transversal) matchings in sufficiently large families F1,…,Fs of tuples in {1,…,n}k, provided s⩾470.

Source: Bulletin of the London Mathematical Society

DOI: 10.1112/blms.12423

Authors: Sergei Kiselev, Andrey Kupavskii

Institutions: Moscow Institute of Physics and Technology, Centre National de la Recherche Scientifique, Princeton University, Institute for Advanced Study, Laboratoire des Sciences pour la Conception, l'Optimisation et la Production

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Institute for Advanced Study, Ministry of Education and Science of the Russian Federation

Awards: G5288383318, AF: Medium: Theory of Computation - New Algorithmic and Hardness Techniques

OpenAlex ID: W3000326684

FWCI: 3.054

Cites: 9

Cited by: 9

Related to: