Add to ORKGWe study the relationship between the independence number of a graph and its semidenite relaxation the Lovasz function We deduce an improved approximation algorithm for the independence number If a graph on n vertices has an independence number nk m for some xed integer k and some m the algorithm nds in random polynomial time an independent set of siz
AbstractLet α(Gn,p) denote the independence number of the random graph Gn,p. Let d=np. We show that ...
AbstractAharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of t...
We propose a new lower bound on the independence number of a graph. We show that our bound compares...
For a connected and non-complete graph, a new lower bound on its independence number is proved. It i...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
AbstractMany functions of the degree sequence of a graph give lower bounds on the graph's independen...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
Abstract: "We show that as n -> [infinity], the independence number ╬▒(G), for almost all 3-regular ...
A family of quadratic programming problems whose optimal values are upper bounds on the independence...
We propose a new lower bound on the independence number of a graph. We show that our bound compares ...
AbstractWei discovered that the independence number of a graph G is at least Σv(1 + d(v))−1. It is p...
Let G be a graph with degree sequence (d v). If the maximum degree of any subgraph induced by a neig...
AbstractLet α(Gn,p) denote the independence number of the random graph Gn,p. Let d=np. We show that ...
AbstractAharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of t...
We propose a new lower bound on the independence number of a graph. We show that our bound compares...
For a connected and non-complete graph, a new lower bound on its independence number is proved. It i...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
AbstractMany functions of the degree sequence of a graph give lower bounds on the graph's independen...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
Abstract: "We show that as n -> [infinity], the independence number ╬▒(G), for almost all 3-regular ...
A family of quadratic programming problems whose optimal values are upper bounds on the independence...
We propose a new lower bound on the independence number of a graph. We show that our bound compares ...
AbstractWei discovered that the independence number of a graph G is at least Σv(1 + d(v))−1. It is p...
Let G be a graph with degree sequence (d v). If the maximum degree of any subgraph induced by a neig...
AbstractLet α(Gn,p) denote the independence number of the random graph Gn,p. Let d=np. We show that ...
AbstractAharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of t...
We propose a new lower bound on the independence number of a graph. We show that our bound compares...