๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Hypergraph coverings and local colorings

โœ Scribed by Yair Caro; Zsolt Tuza

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
474 KB
Volume
52
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Hypergraph colouring and the Lovรกsz Loca
Hypergraph colouring and the Lovรกsz Local Lemma
โœ Colin McDiarmid ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 263 KB

The Lov~sz Local Lemma yields sufficient conditions for a hypergraph to be 2-colourable, that is, to have a colouring of the points blue or red so that no edge is monochromatic. The method yields a general theorem, which shows for example that, if H is a hypergraph in which each edge contains at lea

Algorithms for maximum k-colorings and k
Algorithms for maximum k-colorings and k-coverings of transitive graphs
โœ FวŽnicวŽ Gavril ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 356 KB

Consider a graph G and a positive integer k. The maximum k-coloring problem is to color a maximum number of vertices using k colors, such that no two adjacent vertices have the same color. The maximum k-covering problem is to find k disjoint cliques covering a maximum number of vertices. The present

On splittable colorings of graphs and hy
On splittable colorings of graphs and hypergraphs
โœ Zoltรกn Fรผredi; Radhika Ramamurthi ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 109 KB

## Abstract The notion of a split coloring of a complete graph was introduced by Erdล‘s and Gyรกrfรกs [7] as a generalization of split graphs. In this work, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a twoโ€round game played against an