Sciweavers

121 search results - page 16 / 25
» dm 2010
Sort
View
DM
2010
129views more  DM 2010»
13 years 10 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
DM
2010
78views more  DM 2010»
13 years 10 months ago
Injective colorings of sparse graphs
Let Mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if Mad(G) 5 2 , then i(G) + 1; sim...
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
DM
2010
114views more  DM 2010»
13 years 10 months ago
Remarks on a generalization of the Davenport constant
A generalization of the Davenport constant is investigated. For a finite abelian group G and a positive integer k, let Dk(G) denote the smallest such that each sequence over G of l...
Michael Freeze, Wolfgang A. Schmid
DM
2010
108views more  DM 2010»
13 years 10 months ago
Locally toroidal polytopes and modular linear groups
When the standard representation of a crystallographic Coxeter group G (with string diagram) is reduced modulo the integer d 2, one obtains a finite group Gd often the automorphi...
Barry Monson, Egon Schulte
DM
2010
89views more  DM 2010»
13 years 10 months ago
Polynomial-time dualization of r-exact hypergraphs with applications in geometry
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
Khaled M. Elbassioni, Imran Rauf