SMALL LENGTH CIRCUITS IN EULERIAN ORIENTATIONS OF GRAPHS

被引：0
|
作者：
Perezhogin, Aleksei L'vovich [1 ]
Bykov, Igor Sergeevich [2 ]
Avgustinovich, Sergei Vladimirovich [1 ]
机构：
[1] Sobolev Inst Math, Pr Koptyuga 4, Novosibirsk 630090, Russia
[2] Novosibirsk State Univ, Pirogova Str 1, Novosibirsk 630090, Russia
来源：
SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA | 2024年 / 21卷 / 01期
关键词：
Eulerian orientation of graph; circuit; tournament; complete bipartite graph; boolean cube; NUMBER;
D O I：
10.33048/semi.2024.21.028
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper we investigate estimates for number of 3-, 4- and 5-circuits in eulerian tournaments and 4-circuits in eulerian orientations of complete bipartite graphs and hypercubes. By using obtained relations, we prove uniqueness (up to isomorphism) of orientations, which reach maximum number of 4-circuits in all graph families mentioned above.
引用
收藏
页码：370 / 382
页数：13
相关论文
共 50 条
12345