Some properties and applications of odd-colorable $r$-hypergraphs

Xiying Yuan, Liqun Qi, Jiayu Shao +1

Let $r\ge 2$ and $r$ be even. An $r$-hypergraph $G$ on $n$ vertices is called odd-colorable if there exists a map $\phi :[n]\to [r]$ such that for any edge $\{j_{1},j_{2}…