Michael Molloy

>>When a wealthy bachelor is murdered in his baroque Boston mansion, a bizarre clue holds the key to whodunnit >Martin Greenough's walled-off mansion is the last remaining holdout in the Boston parkland known as the Fenway - and the fact that it eluded condemnation by the city is a testament to the elderly bachelor's great wealth. Childless and nearing the end of his life, he surrounds himself with only his cat, his servants, and a friend, Mrs. Warden - to say nothing of the circle of extended family members whose lives he both subsidizes and rules from afar, the nieces and nephews who all seem to be more fond of Uncle Mart's money than they are of his character. >On the eve of his birthday, Greenough requests the presence of his heirs at his home, insisting that he has something important to discuss. Before that discussion can take place, though, the man is murdered in his study. In one way or another nearly everyone there would benefit...

John Horne Burns brought The Gallery back from World War II, and on publication in 1947 it became a critically-acclaimed bestseller. However, Burns's early death at the age of 36 led to the subsequent neglect of this searching book, which captures the shock the war dealt to the preconceptions and ideals of the victorious Americans. Set in occupied Naples in 1944, The Gallery takes its name from the Galleria Umberto, a bombed-out arcade where everybody in town comes together in pursuit of food, drink, sex, money, and oblivion. A daring and enduring novel—one of the first to look directly at gay life in the military—The Gallery poignantly conveys the mixed feelings of the men and women who fought the war that made America a superpower.

Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality. The topics covered include: Kahn's proofs that the Goldberg-Seymour and List Colouring Conjectures hold asymptotically; a proof that for some absolute constant C, every graph of maximum degree Delta has a Delta+C total colouring; Johansson's proof that a triangle free graph has a O(Delta over log Delta) colouring; algorithmic variants of the Local Lemma which permit the efficient construction of many optimal and near-optimal colourings. This begins with a gentle introduction to the probabilistic method and will be useful to researchers and graduate students in graph theory, discrete mathematics, theoretical computer science and probability.