475 search results - page 2 / 95 » Z3-Connectivity with Independent Number 2 |
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
FAW
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
CPC
2007
13 years 8 months ago
2007
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
For a given connected graph G on n vertices and m edges, we prove that its independence number α(G) is at least ((2m+n+2) -((2m+n+2)2 -16n2 )½ )/8. Keywords : independence numbe...
DM
2010
13 years 8 months ago
2010
For a non-negative integer T, we prove that the independence number of a graph G = (V, E) in which every vertex belongs to at most T triangles is at least uV f(d(u), T) where d(u)...