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

• Дата: 2025
• Автори: Bondarenko, Vitaliy M., Styopochkina, Maryna V.
• Формат: Стаття
• Мова: English
• Опубліковано: Lugansk National Taras Shevchenko University 2025
• Теми: Tits quadratic form; non-serial positive poset; Hasse diagram; circuit rank; scanning tree; Dynkin diagram
• Онлайн доступ: https://admjournal.luguniv.edu.ua/index.php/adm/article/view/2368
• Назва журналу: Algebra and Discrete Mathematics

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 dia...