Rainbow matchings in properly-colored hypergraphs

Abstract: A hypergraph

H

is properly colored if for every vertex

v i n V (H)

, all the edges incident to

v

have distinct colors. In this paper, we show that if

H_{1}

, cdots,

H_{s}

are properly-colored

k

-uniform hypergraphs on

n

vertices, where

n g e q 3 k^{2} s

, and

e (H_{i}) > n c h o o s e k - n - s + 1 c h o o s e k

, then there exists a rainbow matching of size

s

, containing one edge from each

H_{i}

. This generalizes some previous results on the ErdH{o}s Matching Conjecture.

Full work available at URL: https://arxiv.org/abs/1808.04954

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

Cites Work

Cited In (19)

This page was built for publication: Rainbow matchings in properly-colored hypergraphs