Rainbow matchings in k-partite hypergraphs

01/07/2020
by   Sergei Kiselev, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/26/2023

A New Lower Bound in the abc Conjecture

We prove that there exist infinitely many coprime numbers a, b, c with a...
research
11/14/2017

Optimal Tuning of Two-Dimensional Keyboards

We give a new analysis of a tuning problem in music theory, pertaining s...
research
03/07/2018

A proof of the GM-MDS conjecture

The GM-MDS conjecture of Dau et al. (ISIT 2014) speculates that the MDS ...
research
06/08/2020

Crouzeix's Conjecture and related problems

In this paper, we establish several results related to Crouzeix's conjec...
research
03/14/2020

Existence and computation of generalized Wannier functions for non-periodic systems in two dimensions and higher

Exponentially-localized Wannier functions (ELWFs) are a basis of the Fer...
research
12/02/2019

Idealness of k-wise intersecting families

A clutter is k-wise intersecting if every k members have a common elemen...
research
01/08/2022

Simple Algebraic Proofs of Uniqueness for Erdős-Ko-Rado Theorems

We give simpler algebraic proofs of uniqueness for several Erdős-Ko-Rado...

Please sign up or login with your details

Forgot password? Click here to reset