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 条
  • [11] Adding random edges to dense graphs
    Bohman, T
    Frieze, A
    Krivelevich, M
    Martin, R
    RANDOM STRUCTURES & ALGORITHMS, 2004, 24 (02) : 105 - 117
  • [12] Number of edges in inhomogeneous random graphs
    Zhishui Hu
    Liang Dong
    Science China Mathematics, 2021, 64 : 1321 - 1330
  • [13] Number of edges in inhomogeneous random graphs
    Zhishui Hu
    Liang Dong
    Science China(Mathematics), 2021, 64 (06) : 1321 - 1330
  • [14] Number of edges in inhomogeneous random graphs
    Hu, Zhishui
    Dong, Liang
    SCIENCE CHINA-MATHEMATICS, 2021, 64 (06) : 1321 - 1330
  • [15] On the number of edges in random planar graphs
    Gerke, S
    McDiarmid, A
    COMBINATORICS PROBABILITY & COMPUTING, 2004, 13 (02): : 165 - 183
  • [16] Sandwiching random regular graphs between binomial random graphs
    Gao, Pu
    Isaev, Mikhail
    McKay, Brendan D.
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 690 - 701
  • [17] Sandwiching random regular graphs between binomial random graphs
    Gao, Pu
    Isaev, Mikhail
    McKay, Brendan D.
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 690 - 701
  • [18] Colouring random regular graphs
    Shi, Lingsheng
    Wormald, Nicholas
    COMBINATORICS PROBABILITY & COMPUTING, 2007, 16 (03): : 459 - 494
  • [19] Generating random regular graphs
    Kim, J. H.
    Vu, V. H.
    COMBINATORICA, 2006, 26 (06) : 683 - 708
  • [20] Minors in Random Regular Graphs
    Fountoulakis, Nikolaos
    Kuehn, Daniela
    Osthus, Deryk
    RANDOM STRUCTURES & ALGORITHMS, 2009, 35 (04) : 444 - 463
12345