A b s t r a c t. We prove the completeness theorem for the intuitionistic propositional calculus with respect to a certain class of hypergraphs. The standard logical operators $\lor,\land,\implies$ and $\lnot$ are given a clear graph-theoretical interpretation and there is a simple method of computing the value of a complex formula in a given hypergraph.