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 条

[41] Balanced independent sets in graphs omitting large cliques
Laflamme, Claude
Aranda, Andres
Soukup, Daniel T.
Woodrow, Robert
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2019, 137 : 1 - 9
[42] Experimental evaluation of the greedy and random algorithms for finding independent sets in random graphs
Goldberg, M
Hollinger, D
Magdon-Ismail, M
EXPERIMENTAL AND EFFICIENT ALGORITHMS, PROCEEDINGS, 2005, 3503 : 513 - 523
[43] The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs
Paul Beame
Russell Impagliazzo
Ashish Sabharwal
computational complexity, 2007, 16 : 245 - 297
[44] On the hardness of finding balanced independent sets in random bipartite graphs
Perkins, Will
Wang, Yuzhou
PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 2376 - 2397
[45] The resolution complexity of independent sets and vertex covers in random graphs
Beame, Paul
Impagliazzo, Russell
Sabharwal, Ashish
COMPUTATIONAL COMPLEXITY, 2007, 16 (03) : 245 - 297
[46] Regular independent sets
Caro, Yair
Hansberg, Adriana
Pepper, Ryan
DISCRETE APPLIED MATHEMATICS, 2016, 203 : 35 - 46
[47] 11/30 (FINDING LARGE INDEPENDENT SETS IN CONNECTED TRIANGLE-FREE 3-REGULAR GRAPHS)
FRAUGHNAUGH, K
LOCKE, SC
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1995, 65 (01) : 51 - 72
[48] Heuristics for finding large independent sets, with applications to coloring semi-random graphs (extended abstract)
Feige, U
Kilian, J
39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 674 - 683
[49] Periodic Walks on Large Regular Graphs and Random Matrix Theory
Oren, Idan
Smilansky, Uzy
EXPERIMENTAL MATHEMATICS, 2014, 23 (04) : 492 - 498
[50] On large-girth regular graphs and random processes on trees
Backhausz, Agnes
Szegedy, Balazs
RANDOM STRUCTURES & ALGORITHMS, 2018, 53 (03) : 389 - 416

← 1 2 3 4 5 →