Existence of Dynkin scanning trees for non-serial posets with positive Tits quadratic form

Abstract

Let \(G\) be a finite undirected connected graph. The minimum number of edges that must be removed to make the graph acyclic is called the circuit rank of \(G\). If such edges are fixed, the graph that remains is called a spanning tree of \(G\). In this paper we study scanning trees of the Hasse diagrams of connected posets with positive Tits quadratic form.