Spanning a strong digraph by α circuits:: A proof of Gallai's conjecture

被引：9

作者：

Bessy, Stephane ^{[1
]}

Thomasse, Stephan ^{[1
]}

机构：

[1] Univ Montpellier 2, LIRMM, F-34392 Montpellier 5, France

来源：

COMBINATORICA | 2007年 / 27卷 / 06期

关键词：

05C20; 05C38; 05C69; 05C70;

D O I：

10.1007/s00493-007-2073-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In 1963, Tibor Gallai [9] asked whether every strongly connected directed graph D is spanned by a directed circiuits, where alpha is the stability of D. We give a proof of this conjecture.

引用

页码：659 / 667

页数：9

共 50 条

[21] A proof of the strong cosmic censorship conjecture
Hod, Shahar
INTERNATIONAL JOURNAL OF MODERN PHYSICS D, 2020, 29 (14):
[22] Gallai's path decomposition conjecture for block graphs
Chen, Xiaohong
Wu, Baoyindureng
AIMS MATHEMATICS, 2025, 10 (01): : 1438 - 1447
[23] On Gallai's conjecture for graphs with maximum degree 6
Chu, Yanan
Fan, Genghua
Liu, Qinghai
DISCRETE MATHEMATICS, 2021, 344 (02)
[24] Gallai's conjecture for 3-degenerated graphs
Zhang, Junhao
Liu, Qinghai
Hong, Yanmei
DISCRETE MATHEMATICS, 2024, 347 (07)
[25] Gallai's Conjecture For Graphs of Girth at Least Four
Harding, Peter
McGuinness, Sean
JOURNAL OF GRAPH THEORY, 2014, 75 (03) : 256 - 274
[26] Proof of Berge's strong path partition conjecture for k=2
Berger, Eli
Hartman, Irith Ben-Arroyo
EUROPEAN JOURNAL OF COMBINATORICS, 2008, 29 (01) : 179 - 192
[27] Cycle intersection in spanning trees: A shorter proof of a conjecture and applications
Di Fonzo, Pablo De Caria
DISCRETE APPLIED MATHEMATICS, 2024, 350 : 10 - 14
[28] A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid
Berg, AR
Jordán, T
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2003, 88 (01) : 77 - 97
[29] Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection
Chen, Min-Jen
Chao, Kun-Mao
DISCRETE APPLIED MATHEMATICS, 2022, 321 : 19 - 23
[30] Towards the Erdős-Gallai cycle decomposition conjecture
Bucic, Matija
Montgomery, Richard
ADVANCES IN MATHEMATICS, 2024, 437

← 1 2 3 4 5 →