Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
Discrete Applied Mathematics
Maximum cliques in graphs with small intersection number and random intersection graphs
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A guided tour in random intersection graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We study the evolution of the chromatic number of a random intersection graph and show that, in a certain range of parameters, these random graphs can be colored optimally with high probability using different greedy algorithms. Experiments on real network data confirm the positive theoretical predictions and suggest that heuristics for the clique and the chromatic number can work hand in hand proving mutual optimality.