A function f from to R is a connectivity function if the graph of its restriction f|C to any connected subset C of is connected. The main goal of the paper is to prove that every function f:-->R is a sum of n+1 connectivity functions. We will also show that if n>1, then every function g:-->R which is a sum of n connectivity functions is continuous on some perfect set which implies that the number n+1 in our theorem is the best possible. To prove the above results, we establish and then apply the following theorem that is of interest on its own. For every dense G-delta subset G of there are homeomorphisms ,..., of such that the sets G, ,..., cover .
LaTeX 2e source file, requires amstex.sty
DVI and Postscript files are available at the Topology Atlas preprints side.
Last modified May 3, 1998.