We improve the efficiency of Bayesian Network learning procedures, by selecting as search space the equivalence classes of Directed Acyclic Graphs (DAGs), and from them an essential graph as representative of each class. For this purpose, we describe some results, and observe the asymptotical behaviour of its respective ratios.
