2 papers
math.CO2014
Maximizing proper colorings on graphs
Jie Ma, Humberto Naves
The number of proper -colorings of a graph , denoted by , is an important graph parameter that plays fundamental role in graph theory, computational complexity theory…
math.CO2012
A problem of Erdős on the minimum number of -cliques
Shagnik Das, Hao Huang, Jie Ma +2
Fifty years ago Erdős asked to determine the minimum number of -cliques in a graph on vertices with independence number less than l. He conjectured that this minimum is achi…