Given tree T on n vertices, how many k -colorings does it have that use all k colors? HELP!!!

Правка en1, от cosmere, 2021-10-20 20:46:56

I am trying to solve this problem. The editorial for this problem uses the following approach

Can anyone explain me the Inclusion-Exclusion formula shown here?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский cosmere 2021-10-20 20:46:56 376 Initial revision (published)