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
关键词
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 条
  • [41] A proof of Kirillov's conjecture
    Baruch, EM
    ANNALS OF MATHEMATICS, 2003, 158 (01) : 207 - 252
  • [42] Proof of Serban's conjecture
    Bergere, MC
    JOURNAL OF MATHEMATICAL PHYSICS, 1998, 39 (01) : 30 - 46
  • [43] PROOF OF A CONJECTURE OF CHOWLA,S
    TIETAVAINEN, A
    JOURNAL OF NUMBER THEORY, 1975, 7 (03) : 353 - 356
  • [44] A proof of Wright's conjecture
    van den Berg, Jan Bouwe
    Jaquette, Jonathan
    JOURNAL OF DIFFERENTIAL EQUATIONS, 2018, 264 (12) : 7412 - 7462
  • [45] A proof of Ringel’s conjecture
    R. Montgomery
    A. Pokrovskiy
    B. Sudakov
    Geometric and Functional Analysis, 2021, 31 : 663 - 720
  • [46] A proof of Higgins's conjecture
    Braun, G
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2004, 70 (02) : 207 - 212
  • [47] PROOF OF WANG'S CONJECTURE
    杨义先
    Science Bulletin, 1990, (04) : 350 - 352
  • [48] On the Proof of Lin's Conjecture
    Hu, Honggang
    Shao, Shuai
    Gong, Guang
    Helleseth, Tor
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 1822 - 1826
  • [49] A proof of Onsager's conjecture
    Isett, Philip
    ANNALS OF MATHEMATICS, 2018, 188 (03) : 871 - 963
  • [50] A proof of snevily’s conjecture
    Bodan Arsovski
    Israel Journal of Mathematics, 2011, 182 : 505 - 508