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 条

[21] Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs
Carlos Hoppen
Nicholas Wormald
Combinatorica, 2018, 38 : 619 - 664
[22] On the independent domination number of random regular graphs
Duckworth, W.
Wormald, N. C.
COMBINATORICS PROBABILITY & COMPUTING, 2006, 15 (04): : 513 - 522
[23] The existence and efficient construction of large independent sets in general random intersection graphs
Nikoletseas, S
Raptopoulos, C
Spirakis, P
AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 1029 - 1040
[24] Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region
Chen, Zongchen
Galanis, Andreas
Stefankovic, Daniel
Vigoda, Eric
PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 2198 - 2207
[25] Constructions of independent sets in random intersection graphs
Rybarczyk, Katarzyna
THEORETICAL COMPUTER SCIENCE, 2014, 524 : 103 - 125
[26] Matchings and independent sets of a fixed size in regular graphs
Carroll, Teena
Galvin, David
Tetali, Prasad
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2009, 116 (07) : 1219 - 1227
[27] Resolution complexity of independent sets in random graphs
Beame, P
Impagliazzo, R
Sabharwal, A
16TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 52 - 68
[28] Extremal Regular Graphs: Independent Sets and Graph Homomorphisms
Zhao, Yufei
AMERICAN MATHEMATICAL MONTHLY, 2017, 124 (09): : 827 - 843
[29] An upper bound for the number of independent sets in regular graphs
Galvin, David
DISCRETE MATHEMATICS, 2009, 309 (23-24) : 6635 - 6640
[30] Locally Dense Independent Sets in Regular Graphs of Large Girth-An Example of a New Approach
Goering, Frank
Harant, Jochen
Rautenbach, Dieter
Schiermeyer, Ingo
RESEARCH TRENDS IN COMBINATORIAL OPTIMIZATION, 2009, : 163 - +

← 1 2 3 4 5 →