Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz

Designs, Codes and Cryptography - The long-standing Erdős–Faber–Lovász conjecture states that every n-uniform linear hypergaph with n edges has a proper vertex-coloring using...     

Orientations of chain groups

We prove generalizations to chain groups, of Minty's Arc Colouring Lemma and its extension, the well-known Farkas Lemma. In these the orientation of the edges is replaced by an arbitrary chain.A function on a chain groupN isrepresentable if there exists a chainR such that (X)=R·X for allXN. Anorientation is a chain with values ±1. We prove that for a regular chain group a linear function that is representable by an orientation for each chainXN locally, is representable by an orientation globally.     

Rigidity of circle domains whose boundary hasσ-finite linear measure

Summary Let be a circle domain in the Riemann sphere whose boundary has -finite linear measure. We show that is rigid in the sense that any conformal homeomorphism of onto any other circle domain is equal to the restriction of a Möbius transformation. Previously, Kaufman and Bishop have independently found examples of non-rigid circle, domains whose boundary is a Cantor set of (Hausdorff) dimension one.Oblatum 19-VI-1992 & 2-IV-1993Supported by NSF and Sloan Foundation