On vertices of outdegree k in minimally k-arc-connected digraphs

被引：0
|
作者：
Fan, Jun [1 ]
Hu, Xiaomin [1 ]
Yang, Weihua [1 ]
Zhao, Shuang [1 ]
机构：
[1] Taiyuan Univ Technol, Coll Math, Taiyuan 030024, Peoples R China
来源：
DISCRETE APPLIED MATHEMATICS | 2025年 / 361卷
关键词：
Digraph; Out-terminal; In-terminal; Tree representation; Minimally k-arc-connected; ANGLES; NUMBER;
D O I：
10.1016/j.dam.2024.11.009
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let k be a positive integer, and D = (V(D), E(D)) be a minimally k-arc-connected simple digraph. Mader conjectured (Combinatorics 2 (1996) 423-449) that there are at least k + 1 vertices of outdegree k in D. In this paper we prove that there are at least four vertices of outdegree k for k >= 3. (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
引用
收藏
页码：465 / 472
页数：8
相关论文
共 50 条
  • [31] EULERIAN CIRCUITS WITH NO MONOCHROMATIC TRANSITIONS IN EDGE-COLORED DIGRAPHS WITH ALL VERTICES OF OUTDEGREE THREE
    Carraher, James M.
    Hartke, Stephen G.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (01) : 190 - 209
  • [32] Circuits through prescribed vertices in k-connected k-regular graphs
    Häggkvist, R
    Mader, W
    JOURNAL OF GRAPH THEORY, 2002, 39 (02) : 145 - 163
  • [33] Cycles passing through k+1 vertices in k-connected graphs
    Fujisawa, Jun
    Yamashita, Tomoki
    JOURNAL OF GRAPH THEORY, 2008, 58 (02) : 179 - 190
  • [34] Asymptotic enumeration of strongly connected digraphs by vertices and edges
    Perez-Gimenez, Xavier
    Wormald, Nicholas
    RANDOM STRUCTURES & ALGORITHMS, 2013, 43 (01) : 80 - 114
  • [35] On minimally rainbow k-connected graphs
    Schiermeyer, Ingo
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (4-5) : 702 - 705
  • [36] (H, k)-reachability in H-arc-colored digraphs
    Germán Benítez-Bobadilla
    Hortensia Galeana-Sánchez
    César Hernández-Cruz
    Boletín de la Sociedad Matemática Mexicana, 2023, 29
  • [37] The Extremal Sizes of Arc-Maximal (k, l)-Digraphs
    Liqiong Xu
    Hong-Jian Lai
    Yingzhi Tian
    Murong Xu
    Graphs and Combinatorics, 2022, 38
  • [38] (H, k)-reachability in H-arc-colored digraphs
    Benitez-Bobadilla, German
    Galeana-Sanchez, Hortensia
    Hernandez-Cruz, Cesar
    BOLETIN DE LA SOCIEDAD MATEMATICA MEXICANA, 2023, 29 (01):
  • [39] Disjoint Spanning Arborescences in k-Arc-Strong Digraphs
    Li, Ping
    Lai, Hong-Jian
    Xu, Murong
    ARS COMBINATORIA, 2019, 143 : 147 - 163
  • [40] The Extremal Sizes of Arc-Maximal (k, l)-Digraphs
    Xu, Liqiong
    Lai, Hong-Jian
    Tian, Yingzhi
    Xu, Murong
    GRAPHS AND COMBINATORICS, 2022, 38 (03)
12345