𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Star forests, dominating sets and Ramsey-type problems

✍ Scribed by Sheila Ferneyhough; Ruth Haas; Denis Hanson; Gary MacGillivray

Book ID
108315624
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
89 KB
Volume
245
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dominating sets for rectilinear center l
Dominating sets for rectilinear center location problems with polyhedral barriers
✍ P.M. Dearing; H.W. Hamacher; K. Klamroth πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 199 KB

## Abstract In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective functi

On three zero-sum Ramsey-type problems
On three zero-sum Ramsey-type problems
✍ Noga Alon; Yair Caro πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 821 KB

## Abstract For a graph __G__ whose number of edges is divisible by __k__, let __R__(__G,Z__~k~) denote the minimum integer __r__ such that for every function __f__: __E__(__K__~r~) ↦ __Z__~k~ there is a copy __G__^1^ of __G__ in __K__~r~ so that Ξ£e∈__E__(__G__^1^) __f(e)__ = 0 (in __Z__~k~). We pr

A Ramsey-type problem and the TurΓ‘n numb
A Ramsey-type problem and the TurΓ‘n numbers
✍ N. Alon; P. ErdΕ‘s; D. S. Gunderson; M. Molloy πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 101 KB

## Abstract For each __n__ and __k__, we examine bounds on the largest number __m__ so that for any __k__‐coloring of the edges of __K~n~__ there exists a copy of __K~m~__ whose edges receive at most __kβˆ’__1 colors. We show that for $k \ge \sqrt{n}\;+\,\Omega(n^{1/3})$, the largest value of __m__ i

Independence numbers of locally sparse g
Independence numbers of locally sparse graphs and a Ramsey type problem
✍ Noga Alon πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 409 KB πŸ‘ 1 views

Let G = (V, E ) be a graph on n vertices with average degree t 2 1 in which for every vertex u E V the induced subgraph on the set of all neighbors of u is r-colorable. We show that the independence number of G is at least log t , for some absolute positive constant c. This strengthens a well-known