We generalise a sparsity condition for hypergraphs and show a result relating sparseness of hypergraphs to the decomposition of a modified incidence graph into edge-disjoint forests. We also give new sparsity conditions for posets and define an algorithm of pebble game type for posets to test when these sparsity conditions hold. Furthermore, we prove that under natural conditions, the sparsity conditions define a greedoid.