Packing edges in random regular graphs

被引：0
|
作者：
Beis, M [1 ]
Duckworth, W
Zito, M
机构：
[1] Macquarie Univ, Dept Comp, Sydney, NSW 2109, Australia
[2] Univ Liverpool, Dept Comp Sci, Liverpool L69 7ZF, Merseyside, England
来源：
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002 | 2002年 / 2420卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense). We consider the problem of approximating the solution to the maximum k-separated matching problem in random r-regular graphs for each fixed integer k and each fixed r greater than or equal to 3. We prove both constructive lower bounds and combinatorial upper bounds on the size of the optimal solutions.
引用
收藏
页码：118 / 130
页数：13
相关论文
共 50 条
  • [21] Random Matchings in Regular Graphs
    Jeff Kahn
    Jeong Han Kim
    Combinatorica, 1998, 18 : 201 - 226
  • [22] Random strongly regular graphs?
    Cameron, PJ
    DISCRETE MATHEMATICS, 2003, 273 (1-3) : 103 - 114
  • [23] THE DIAMETER OF RANDOM REGULAR GRAPHS
    BOLLOBAS, B
    DELAVEGA, WF
    COMBINATORICA, 1982, 2 (02) : 125 - 134
  • [24] Generating Random Regular Graphs
    J. H. Kim
    V. H. Vu*
    Combinatorica, 2006, 26 : 683 - 708
  • [25] Random matchings in regular graphs
    Kahn, J
    Kim, JH
    COMBINATORICA, 1998, 18 (02) : 201 - 226
  • [26] Regular subgraphs of random graphs
    Bollobas, Bela
    Kim, Jeong Han
    Verstraete, Jacques
    RANDOM STRUCTURES & ALGORITHMS, 2006, 29 (01) : 1 - 13
  • [27] The logic of random regular graphs
    Haber, Simi
    Krivelevich, Michael
    JOURNAL OF COMBINATORICS, 2010, 1 (04) : 389 - 440
  • [28] GENERATING RANDOM REGULAR GRAPHS
    WORMALD, NC
    JOURNAL OF ALGORITHMS, 1984, 5 (02) : 247 - 280
  • [29] RANDOM FLIGHTS ON REGULAR GRAPHS
    TAKACS, L
    ADVANCES IN APPLIED PROBABILITY, 1984, 16 (03) : 618 - 637
  • [30] Sprinkling with random regular graphs*
    Isaev, Mikhail
    Mckay, Brendan D.
    Southwell, Angus
    Zhukovskii, Maksim
    ELECTRONIC JOURNAL OF PROBABILITY, 2025, 30 : 1 - 20
12345