A hypergraph $H$ is properly colored if for every vertex $v\in V(H)$, all the edges incident to $v$ have distinct colors. In this paper, we show that if $H_{1}, \ldots, H_{s}$ are properly-colored $k$-uniform hypergraphs on $n$ vertices, where $n\geq3k^{2}s$, and $e(H_{i})>{{n}\choose {k}}-{{n-s+1}\choose {k}}$, then there exists a rainbow matching of size $s$, containing one edge from each $H_i$. This generalizes some previous results on the Erdős Matching Conjecture.
@article{10_37236_8125,
author = {Hao Huang and Tong Li and Guanghui Wang},
title = {Rainbow matchings in properly-colored hypergraphs},
journal = {The electronic journal of combinatorics},
year = {2019},
volume = {26},
number = {1},
doi = {10.37236/8125},
zbl = {1441.05182},
url = {http://geodesic.mathdoc.fr/articles/10.37236/8125/}
}
TY - JOUR
AU - Hao Huang
AU - Tong Li
AU - Guanghui Wang
TI - Rainbow matchings in properly-colored hypergraphs
JO - The electronic journal of combinatorics
PY - 2019
VL - 26
IS - 1
UR - http://geodesic.mathdoc.fr/articles/10.37236/8125/
DO - 10.37236/8125
ID - 10_37236_8125
ER -
%0 Journal Article
%A Hao Huang
%A Tong Li
%A Guanghui Wang
%T Rainbow matchings in properly-colored hypergraphs
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/8125/
%R 10.37236/8125
%F 10_37236_8125
Hao Huang; Tong Li; Guanghui Wang. Rainbow matchings in properly-colored hypergraphs. The electronic journal of combinatorics, Tome 26 (2019) no. 1. doi: 10.37236/8125
