Large independent sets in random regular graphs

被引：10

作者：

Duckworth, William ^{[2
]}

Zito, Michele ^{[1
]}

机构：

[1] Univ Liverpool, Dept Comp Sci, Liverpool L69 3BX, Merseyside, England

[2] Australian Natl Univ, Inst Math Sci, Canberra, ACT 0200, Australia

来源：

THEORETICAL COMPUTER SCIENCE | 2009年 / 410卷 / 50期

关键词：

Random graphs; Independent sets; Approximation algorithms; APPROXIMATION ALGORITHMS; NUMBER; HARD;

D O I：

10.1016/j.tcs.2009.08.025

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present algorithmic lower bounds on the size s(d) of the largest independent sets of vertices in random d-regular graphs, for each fixed d >= 3. For instance, for d = 3 we prove that, for graphs on n vertices, s(d) >= 0.43475n with probability approaching one as n tends to infinity. (C) 2009 Published by Elsevier B.V.

引用

页码：5236 / 5243

页数：8

共 50 条

[31] COMPUTING INDEPENDENT SETS IN GRAPHS WITH LARGE GIRTH
MURPHY, OJ
DISCRETE APPLIED MATHEMATICS, 1992, 35 (02) : 167 - 170
[32] Finding large independent sets in graphs and hypergraphs
Shachnai, H
Srinivasan, A
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 18 (03) : 488 - 500
[33] CONNECTED GRAPHS WITH A LARGE NUMBER OF INDEPENDENT SETS
Jou, Min-Jen
TAIWANESE JOURNAL OF MATHEMATICS, 2013, 17 (06): : 2011 - 2017
[34] Independent dominating sets and a second Hamiltonian cycle in regular graphs
Thomassen, C
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1998, 72 (01) : 104 - 109
[35] Minimum independent dominating sets of random cubic graphs
Duckworth, W
Wormald, NC
RANDOM STRUCTURES & ALGORITHMS, 2002, 21 (02) : 147 - 161
[36] On the spectral distribution of large weighted random regular graphs
Goldmakher, Leo
Khoury, Cap
Miller, Steven J.
Ninsuwan, Kesinee
RANDOM MATRICES-THEORY AND APPLICATIONS, 2014, 3 (04)
[37] The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs
Bal, Deepak
Bennett, Patrick
ELECTRONIC JOURNAL OF COMBINATORICS, 2023, 30 (01):
[38] Triangle Factors of Graphs Without Large Independent Sets and of Weighted Graphs
Balogh, Jozsef
Molla, Theodore
Sharifzadeh, Maryam
RANDOM STRUCTURES & ALGORITHMS, 2016, 49 (04) : 669 - 693
[39] 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
[40] Minimizing the number of independent sets in triangle-free regular graphs
Cutler, Jonathan
Radcliffe, A. J.
DISCRETE MATHEMATICS, 2018, 341 (03) : 793 - 800

← 1 2 3 4 5 →