Birational equivalence of reduced graphs
Reduced graphs representing antisymmetric digraphs are investigated. The author gives an arithmetical characterization of these graphs using sequences of natural numbers representing a partial ordering by its maximal chains. For such graphs, methods similar to those used in birational geometry are defined. A class of equivalent graphs is studied and a canonical graph with a minimum number of points in the class is characterized.
scientific article; zbMATH DE number 1121651