July 2024
·
3 Reads
The Bulletin of the Malaysian Mathematical Society Series 2
This paper is motivated by the problem of determining the related chromatic numbers of some hypergraphs. A hypergraph is defined from a projective space PG, where the vertices are points and the hyperedges are -dimensional subspaces. For the perfect balanced rainbow-free colorings, we show that , where and l is the smallest nontrivial factor of . For the complete colorings, we prove that there is no complete coloring for with . We also provide some results on the related chromatic numbers of subhypergraphs of .