#####
Séminaire Lotharingien de Combinatoire, B05k (1981), 4 pp.

[Formerly: Publ. I.R.M.A. Strasbourg, 1982, 182/S-04, p.
105-108.]

# Ulrich Faigle

# The Greedy Algorithm as a Combinatorial Principle

**Abstract.**
In this note, we want to give an outline how a combinatorial theory
including, in particular, matching theory may be based on a very
simple combinatorial principle. This principle states that, under
certain restrictions, an optimal combinatorial object can be
constructed in a straight-forward manner, namely by the "greedy
algorithm".

The following versions are available: