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...     

Asymptotic Analysis of Finite-Source M/GI/1 Retrial Queueing Systems with Collisions and Server Subject to Breakdowns and Repairs

Methodology and Computing in Applied Probability - This paper deals with a retrial queuing system with a finite number of sources and collision of the customers, where the server is subject to...     

Correction to: Preface

Foundations of Computational Mathematics -     

The crystal structure of eudesma-4(15),7(11)-dien-8α, 12-olide: a sesquiterpene lactone fromTrattinickia rhoifolia Willd

The title compound, formula C₁₅H₂₀O₂, is orthorhombic, P2₁2₁2₁ witha=8.747(2),b=12.025(3),c=12.554(3)Å,Z=4, andD _m =1.32(2)g/ml. The structural analysis shows that the compound corresponds to eudesma-4(15),7(11)-dien-8,12-olide, a sesquiterpene lactone previously isolated fromAster umbellatus but whose crystal structure was unknown.     

A note on packing paths in planar graphs

Seymour (1981) proved that the cut criterion is necessary and sufficient for the solvability of the edge-disjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, Middendorf and Pfeiffer (1993) proved the problem to be NP-complete. For this case, Korach and Penn (1992) proved that the cut criterion is sufficient for the existence of a near-complete packing of paths. Here we generalize this result by showing how a natural strengthening of the cut criterion yields better packings of paths.Analogously to Seymour's approach, we actually prove a theorem on packing cuts in an arbitrary graph and then the planar edge-disjoint paths case is obtained by planar dualization. The main result is derived from a theorem of Seb (1990) on the structure of ±1 weightings of a bipartite graph with no negative circuits.Research partially supported by the Hungarian National Foundation for Scientific Research Grants OTKA 2118 and 4271.     

Lines of curvature near umbilical points on surfaces immersed in R4

LetM be a compact orientable surface,I:M R⁴ an immersion of classC ^r and a normal unitary smooth vector field. We prove that in the space of pairs (I, ) the family of pairs all whose umbilical points are Darbouxian is generic.     

Covering with blocks in the non-symmetric case

Considering an infinite string of i.i.d. random letters drawn from a finite alphabet we define the cover timeW _n as the number of random letters needed until each pattern of lenghtn appears at least once as a substring. Sharp weak and a.s. limit results onW _n are known in the symmetric case, i.e., when the random letters are uniformly distributed over the alphabet. In this paper we determine the limit distribution ofW _n in the nonsymmetric case asn. Generalizations in terms of point processes are also proved.Dedicated to Endre Csáki on his 60th birthday.     

Selberg's inequality in arithmetic progressions. II

We obtain an elementary derivation for Selberg's formula related to the function ψ _{r, k} ^* (x; q, ?) for allr, k positive integers.