1591 search results - page 25 / 319 » Random lifts of graphs |
120
Voted
AML
1999
15 years 13 days ago
1999
We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the mon...
94
Voted
STOC
2007
ACM
16 years 1 months ago
2007
ACM
110
click to vote
STACS
2007
Springer
15 years 6 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
95
Voted
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
100
click to vote
RSA
2011
14 years 7 months ago
2011
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...