2015/07/09 by Mishra, Tapas Kumar, Pal, Sudebkumar Prasant
#05C65 #05D05 #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #G.2.1 #G.2.2
paper · doi:10.48550/arxiv.1507.02463
Let G(V,E) be a k-uniform hypergraph. A hyperedge e ∈ E is said to be properly (r,p) colored by an r-coloring of vertices in V if e contains vertices of at least p distinct colors in the r-coloring. An r-coloring of vertices in V is called a \it strong (r,p) coloring if every hyperedge e ∈ E is properly (r,p) colored by the r-coloring. We study the maximum number of hyperedges that can be properly (r,p) colored by a single r-coloring and the structures that maximizes number of properly (r,p) colored hyperedges.