SPARSE SPANNING κ-CONNECTED SUBGRAPHS IN TOURNAMENTS

被引：3

作者：

Kang, Dong Yeap ^{[1
]}

Kim, Jaehoon ^{[2
]}

Kim, Younjin ^{[3
]}

Suh, Geewon ^{[4
]}

机构：

[1] Korea Adv Inst Sci & Technol, Dept Math Sci, 291 Daehak Ro, Daejeon 305701, South Korea

[2] Univ Birmingham, Sch Math, Birmingham B15 2TT, W Midlands, England

[3] Ewha Womans Univ, Inst Math Sci, Seoul, South Korea

[4] Korea Adv Inst Sci & Technol, Sch Elect Engn, 291 Daehak Ro, Daejeon 305701, South Korea

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 2017年 / 31卷 / 03期

基金：

新加坡国家研究基金会; 欧洲研究理事会;

关键词：

tournament; connectivity; subgraph; MINIMUM DEGREE; DIGRAPHS; CYCLES; SUBDIGRAPHS; ALGORITHM; ARCS;

D O I：

10.1137/16M1064805

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In 2009, Bang-Jensen asked whether there exists a function g(kappa) such that every strongly kappa-connected n-vertex tournament contains a strongly kappa-connected spanning subgraph with at most kappa n broken vertical bar g(k) arcs. In this paper, we answer the question by showing that every strongly kappa-connected n-vertex tournament contains a strongly kappa-connected spanning subgraph with at most kappa n+750k(2) log(2)(kappa+1) arcs, and there is a polynomial-time algorithm to find the spanning subgraph.

引用

页码：2206 / 2227

页数：22

共 50 条

[21] 2-Connected spanning subgraphs of circuit graphs
Nakamoto, Atsuhiro
Ozeki, Kenta
Takahashi, Daiki
DISCRETE MATHEMATICS, 2025, 348 (01)
[22] Properties on the average number of spanning trees in connected spanning subgraphs for an undirected graph
Cheng, P
Masuyama, S
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2003, E86A (05) : 1027 - 1033
[23] 2-CONNECTED SPANNING SUBGRAPHS OF PLANAR 3-CONNECTED GRAPHS
BARNETTE, DW
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1994, 61 (02) : 210 - 216
[24] Asymptotic behavior of spanning forests and connected spanning subgraphs on two-dimensional lattices
Chang, Shu-Chiuan
Shrock, Robert
INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2020, 34 (27):
[25] Spanning Even Subgraphs of 3-Edge-Connected Graphs
Jackson, Bill
Yoshimoto, Kiyoshi
JOURNAL OF GRAPH THEORY, 2009, 62 (01) : 37 - 47
[26] On 2-connected spanning subgraphs with low maximum degree
Sanders, DP
Zhao, Y
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1998, 74 (01) : 64 - 86
[27] Packing spanning trees and spanning 2-connected k-edge-connected essentially -edge-connected subgraphs
Gu, Xiaofeng
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (03) : 924 - 933
[28] Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs
Xiangwen Li
Chunxiang Wang
Qiong Fan
Zhaohong Niu
Liming Xiong
Graphs and Combinatorics, 2013, 29 : 275 - 280
[29] Generating minimal spanning k-vertex connected subgraphs
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Rudolf, Gabor
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2007, 4598 : 222 - +
[30] Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs
Li, Xiangwen
Wang, Chunxiang
Fan, Qiong
Niu, Zhaohong
Xiong, Liming
GRAPHS AND COMBINATORICS, 2013, 29 (02) : 275 - 280

← 1 2 3 4 5 →