We prove that every connected graph of order n ≥ 2 has an induced subgraph with all degrees odd of order at least cn/log n, where cis a constant. We also give a bound in terms of chromatic number, and resolve the analogous problem for random graphs.

An analytic study is made of the correlation structure of Tausworthe and linear congruential random number generators. The former case is analyzed by the bit mask correlations recently introduced by Compagner. The latter is studied first by an extension to word masks, which include spectral test coefficients as special cases, and then by the bit mask procedure. Although low order bit mask coefficients vanish in both cases, the Tausworthe generator appears to produce a substantially smaller non-vanishing correlation set for large masks – but with larger correlation values – than does the linear congruential.

The smallest minimal degree of an r-partite graph that guarantees the existence of a complete subgraph of order r has been found for the case r = 3 by Bollobás, Erdő and Szemerédi, who also gave bounds for the cases r ≥ 4. In this paper the exact value is established for the cases r = 4 and 5, and the bounds for r ≥ 6 are improved.

Motivated by the problem of making correct computations from partly false information, we study a corruption of the classic game “Twenty Questions” in which the player who answers the yes-or-no questions is permitted to lie up to a fixed fraction r of the time. The other player is allowed q arbitrary questions with which to try to determine, with certainty, which of n objects his opponent has in mind; he “wins” if he can always do so, and “wins quickly” if he can do so using only O(log n) questions.

It turns out that there is a threshold value for r below which the querier can win quickly, and above which he cannot win at all. However, the threshold value varies according to the precise rules of the game. Our “three thresholds theorem” says that when the answerer is forbidden at any point to have answered more than a fraction r of the questions incorrectly, then the threshold value is r = ½; when the requirement is merely that the total number of lies cannot exceed rq, the threshold is ⅓; and finally if the answerer gets to see all the questions before answering, the threshold drops to ¼.

For every n consider a subset Hn of the patterns of length n over a fixed finite alphabet. The limit distribution of the waiting time until each element of Hn appears in an infinite sequence of independent, uniformly distributed random letters was determined in an earlier paper. This time we prove that these waiting times are getting independent as n → ∞. Our result is used for applying the converse part of the Borel–Cantelli lemma to problems connected with such waiting times, yielding thus improvements on some known theorems.

The paper is concerned with tools for the quantitative analysis of finite Markov chains whose states are combinatorial structures. Chains of this kind have algorithmic applications in many areas, including random sampling, approximate counting, statistical physics and combinatorial optimisation. The efficiency of the resulting algorithms depends crucially on the mixing rate of the chain, i.e., the time taken for it to reach its stationary or equilibrium distribution.

The paper presents a new upper bound on the mixing rate, based on the solution to a multicommodity flow problem in the Markov chain viewed as a graph. The bound gives sharper estimates for the mixing rate of several important complex Markov chains. As a result, improved bounds are obtained for the runtimes of randomised approximation algorithms for various problems, including computing the permanent of a 0–1 matrix, counting matchings in graphs, and computing the partition function of a ferromagnetic Ising system. Moreover, solutions to the multicommodity flow problem are shown to capture the mixing rate quite closely: thus, under fairly general conditions, a Markov chain is rapidly mixing if and only if it supports a flow of low cost.

The substitution method is used to show that the percolative behaviour of the triangular and hexagonal lattices bond percolation models are similar near their critical probabilities. As a consequence, if the limits defining the critical exponents β and γ exist, these lattices have the same values of β and γ. Similarly, the method also shows equality of the β and γ values for bond percolation models on the bowtie lattice and its dual.

Suppose that a process begins with n isolated vertices, to which edges are added randomly one by one so that the maximum degree of the induced graph is always bounded above by d. We prove that if n → ∞ with d fixed, then with probability tending to 1, the final result of this process is a graph with ⌊nd / 2⌋ edges.

We consider a random digraph Din, out(n) on vertices 1, …, n, where, for each vertex v, we choose at random one of the n possible arcs with head v and one of the n possible arcs with tail v. We show that the expected size of the largest component of Din, out is .

Along different curves and at different points of the (x, y)-plane the Tutte polynomial evaluates a wide range of quantities. Some of these, such as the number of spanning trees of a graph and the partition function of the planar Ising model, can be computed in polynomial time, others are # P-hard. Here we give a complete characterisation of which points and curves are easy/hard in the bipartite case.

If G is a plane, cubic graph, then G has a drawing such that each edge is a straight line segment and each bounded face has any prescribed area. The special case where all areas are the same proves a conjecture of G. Ringel, who gave an example of a plane triangulation that cannot be drawn in this way.

Notions of deletion and contraction for the class of set functions from finite sets into the integers are defined. An operation on a subclass of such set functions is a function from the subclass into itself that preserves ground sets and respects isomorphism. The operations on set functions that interchange deletion and contraction are characterised, as are those with the further property of being involutary. Similar results are given for polymatroids. There is a unique involutary operation on the class of k-polymatroids that interchanges deletion and contraction. The results generalise those of Kung [3].