Universal arcs in tournaments

被引：1

作者：

Bai, Yandong ^{[1
,2
]}

Li, Binlong ^{[1
,3
]}

Li, Hao ^{[2
,4
]}

He, Weihua ^{[2
]}

机构：

[1] Northwestern Polytech Univ, Dept Appl Math, Xian 710129, Peoples R China

[2] Univ Paris 11, CNRS, Lab Rech Informat, F-91405 Orsay, France

[3] Univ W Bohemia, Dept Math, Plzen 30614, Czech Republic

[4] Jianghan Univ, Inst Interdisciplinary Res, Wuhan 430056, Peoples R China

来源：

DISCRETE MATHEMATICS | 2016年 / 339卷 / 08期

关键词：

Universal arc; Tournament;

D O I：

10.1016/j.disc.2016.02.011

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An arc uv of a digraph D is called universal if uv and w are in a common cycle for any vertex w of D. We show that every arc of a tournament T is universal if and only if T is either 2-connected or has a cut-vertex v such that the in- and out-neighbors of v both induce strongly connected subtournaments. (C) 2016 Elsevier B.V. All rights reserved.

引用

页码：2063 / 2065

页数：3

共 50 条

[1] Universal arcs in local tournaments
Meng, Wei
Guo, Jia
Lu, Mei
Guo, Yubao
Volkmann, Lutz
DISCRETE MATHEMATICS, 2017, 340 (12) : 2900 - 2915
[2] Pancyclic arcs and connectivity in tournaments
Havet, F
JOURNAL OF GRAPH THEORY, 2004, 47 (02) : 87 - 110
[3] Decycling Bipartite Tournaments by Deleting Arcs
Vandell, Robert C.
ARS COMBINATORIA, 2014, 116 : 331 - 342
[4] Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments
Bang-Jensen, Jorgen
Depres, Hugues
Yeo, Anders
DISCRETE MATHEMATICS, 2020, 343 (12)
[5] Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments
Yeo, A
JOURNAL OF GRAPH THEORY, 1999, 32 (02) : 123 - 136
[6] Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments
Bang-Jensen, J
Huang, J
Yeo, A
JOURNAL OF GRAPH THEORY, 2004, 46 (04) : 265 - 284
[7] Disjoint cycles in tournaments and bipartite tournaments
Chen, Bin
Chang, An
JOURNAL OF GRAPH THEORY, 2024, 105 (02) : 297 - 314
[8] Finding and counting small tournaments in large tournaments
Yuster, Raphael
THEORETICAL COMPUTER SCIENCE, 2025, 1024
[9] Extremal Results on Disjoint Cycles in Tournaments and Bipartite Tournaments
Chen, Bin
JOURNAL OF GRAPH THEORY, 2025,
[10] Unavoidable tournaments
Shapira, Asaf
Yuster, Raphael
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 116 : 191 - 207

← 1 2 3 4 5 →