Few colored cuts or cycles in edge colored graphs
The canonization theorem says that for given for some (the first one is called ) we have for every function with domain , for some , the question of when the equality (where and are from ) holds has the simplest answer: for some the equality holds iff . We improve the bound on so that fixing the number of exponentiation needed to calculate is best possible.