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 条
  • [1] Packing vertices and edges in random regular graphs
    Beis, Mihalis
    Duckworth, William
    Zito, Michele
    RANDOM STRUCTURES & ALGORITHMS, 2008, 32 (01) : 20 - 37
  • [2] Discordant edges for the voter model on regular random graphs
    Avena, Luca
    Baldasso, Rangel
    Hazra, Rajat Subhra
    den Hollander, Frank
    Quattropani, Matteo
    ALEA-LATIN AMERICAN JOURNAL OF PROBABILITY AND MATHEMATICAL STATISTICS, 2024, 21 : 431 - 464
  • [3] RANDOM NEAR-REGULAR GRAPHS AND THE NODE PACKING PROBLEM
    GRIMMETT, GR
    PULLEYBLANK, WR
    OPERATIONS RESEARCH LETTERS, 1985, 4 (04) : 169 - 174
  • [4] PACKING IN REGULAR GRAPHS
    Henning, Michael A.
    Klostermeyer, William F.
    QUAESTIONES MATHEMATICAE, 2018, 41 (05) : 693 - 706
  • [5] Hamilton cycles containing randomly selected edges in random regular graphs
    Robinson, RW
    Wormald, NC
    RANDOM STRUCTURES & ALGORITHMS, 2001, 19 (02) : 128 - 147
  • [6] Random packing by rho-connected rho-regular graphs
    Beineke, LW
    Hamburger, P
    Weakley, WD
    DISCRETE MATHEMATICS, 1996, 160 (1-3) : 41 - 47
  • [7] On the asymmetry of random regular graphs and random graphs
    Kim, JH
    Sudakov, B
    Vu, VH
    RANDOM STRUCTURES & ALGORITHMS, 2002, 21 (3-4) : 216 - 224
  • [8] On packing Hamilton cycles in ε-regular graphs
    Frieze, A
    Krivelevich, M
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2005, 94 (01) : 159 - 172
  • [9] Packing Random Graphs and Hypergraphs
    Bollobas, Bela
    Janson, Svante
    Scott, Alex
    RANDOM STRUCTURES & ALGORITHMS, 2017, 51 (01) : 3 - 13
  • [10] Packing plane spanning graphs with short edges in complete geometric graphs
    Aichholzer, Oswin
    Hackl, Thomas
    Korman, Matias
    Pilz, Alexander
    van Renssen, Andre
    Roeloffzen, Marcel
    Rote, Gunter
    Vogtenhuber, Birgit
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2019, 82 (1-15): : 1 - 15
12345