Combinatorial characterization of read-once formulae

Abstract We give an alternative proof to a characterization theorem of Gurvich for Boolean functions whose formula size is exactly the number of variables. These functions are called read-once functions. We use methods of combinatorial optimization and give, as a corollary, an alternative proof for some results of Seymour (1976, 1977).