Sciweavers

DAM
2011
13 years 5 months ago
Independence in connected graphs
We prove that if G = (VG, EG) is a finite, simple, and undirected graph with κ components and independence number α(G), then there exist a positive integer k ∈ N and a functi...
Jochen Harant, Dieter Rautenbach
COMBINATORICS
2000
103views more  COMBINATORICS 2000»
13 years 10 months ago
The Action of the Symmetric Group on a Generalized Partition Semilattice
Given an integer n 2, and a non-negative integer k, consider all affine hyperplanes in Rn of the form xi = xj +r for i, j [n] and a non-negative integer r k. Let n,k be the pos...
Robert Gill
DM
2010
129views more  DM 2010»
13 years 11 months ago
Interpolating between bounds on the independence number
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)...
Anett Boßecker, Dieter Rautenbach