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

Coloring nearly-disjoint hypergraphs with n + o(n) colors

โœ Scribed by Jeff Kahn

Book ID
103507933
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
395 KB
Volume
59
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Nearly optimal distributed edge coloring
Nearly optimal distributed edge coloring in O(log log n) rounds
โœ David A. Grable; Alessandro Panconesi ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 220 KB

An extremely simple distributed randomized algorithm is presented which with ## ลฝ . high probability properly edge colors a given graph using 1 q โŒฌ colors, where โŒฌ is the maximum degree of the graph and is any given positive constant. The algorithm is very ลฝ fast. In particular, for graphs with su

An Oฬƒ(n314)-coloring algorithm for 3-col
An Oฬƒ(n314)-coloring algorithm for 3-colorable graphs
โœ Avrim Blum; David Karger ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 471 KB

We show how the results of Karger, Motwani, and Sudan ( 1994) and Blum ( 1994) can be combined in a natural manner to yield a polynomial-time algorithm for d(n3"4 )-coloring any n-node 3-colorable graph. This improves on the previous best bound of 6(n'14) colors (Karger et al., 1994).

Two-dimensional gauge theories with diag
Two-dimensional gauge theories with diagonal SU(N) color
โœ Paul J Steinhardt ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 736 KB

## Two-dimensional gauge theories with diagonal SU(N) color symmetry are analyzed in the limit of strong coupling using bosonization techniques. A spectrum of heavy mesons is found in addition to a spectrum of light baryon and baryonium states. Exotic behavior is also found for various values of t