We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP-hard problems are easier to solve, and in particular, whether there exist algorithms that solve in polynomial time all sufficiently stable instances of some NP-hard problem. The paper focuses on the Max-Cut problem, for which we show that this is indeed the case.

A class of labelled graphs is bridge-addable if, for all graphs G in and all vertices u and v in distinct connected components of G, the graph obtained by adding an edge between u and v is also in ; the class is monotone if, for all G ∈ and all subgraphs H of G, we have H ∈ . We show that for any bridge-addable, monotone class whose elements have vertex set {1,. . .,n}, the probability that a graph chosen uniformly at random from is connected is at least (1−on(1))e−½, where on(1) → 0 as n → ∞. This establishes the special case of the conjecture of McDiarmid, Steger and Welsh when the condition of monotonicity is added. This result has also been obtained independently by Kang and Panagiotou.

A detachment of a hypergraph is formed by splitting each vertex into one or more subvertices, and sharing the incident edges arbitrarily among the subvertices. For a given edge-coloured hypergraph , we prove that there exists a detachment such that the degree of each vertex and the multiplicity of each edge in (and each colour class of ) are shared fairly among the subvertices in (and each colour class of , respectively).

Let be a hypergraph with vertex partition {V1,. . .,Vn}, |Vi| = pi for 1 ≤ i ≤ n such that there are λi edges of size hi incident with every hi vertices, at most one vertex from each part for 1 ≤ i ≤ m (so no edge is incident with more than one vertex of a part). We use our detachment theorem to show that the obvious necessary conditions for to be expressed as the union 1 ∪ ··· ∪ k of k edge-disjoint factors, where for 1 ≤ i ≤ k, i is ri-regular, are also sufficient. Baranyai solved the case of h1 = ··· = hm, λ1 = ··· = λm = 1, p1 = ··· = pm, r1 = ··· = rk. Berge and Johnson (and later Brouwer and Tijdeman, respectively) considered (and solved, respectively) the case of hi = i, 1 ≤ i ≤ m, p1 = ··· = pm = λ1 = ··· = λm = r1 = ··· = rk = 1. We also extend our result to the case where each i is almost regular.

We show that there are graphs with n vertices containing no K5,5 which have about n7/4 edges, thus proving that ex(n, K5,5) ≥ (1 + o(1))n7/4. This bound gives an asymptotic improvement to the known lower bounds on ex(n, Kt, s) for t = 5 when 5 ≤ s ≤ 12, and t = 6 when 6 ≤ s ≤ 8.

Richard Schelp completed his PhD in lattice theory in 1970 at Kansas State University. However, he did not take a traditional route to a PhD in mathematics and an outstanding career as a professor and a mathematical researcher. He grew up in rural northeast Missouri. He received his BS in mathematics and physics from the University of Central Missouri. After the completion of his master's degree in mathematics from Kansas State University, he assumed a position as an associate mathematician in the Applied Science Laboratory at Johns Hopkins University for five years. To start his PhD programme at Kansas State University, he had to quit a well-paying position. Also, he was already married to his wife Billie (Swopes) Schelp and he had a family – a daughter Lisa and a son Rick. This was a courageous step to take, but it says something about who Dick Schelp was.

Given a locally finite connected infinite graph G, let the interval [pmin(G), pmax(G)] be the smallest interval such that if p > pmax(G), then every 1-independent bond percolation model on G with bond probability p percolates, and for p < pmin(G) none does. We determine this interval for trees in terms of the branching number of the tree. We also give some general bounds for other graphs G, in particular for lattices.

For c ∈ (0,1) let n(c) denote the set of n-vertex perfect graphs with density c and let n(c) denote the set of n-vertex graphs without induced C5 and with density c.

We show that with otherwise, where H is the binary entropy function.

Further, we use this result to deduce that almost all graphs in n(c) have homogeneous sets of linear size. This answers a question raised by Loebl and co-workers.

A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers; we call such a linear extension a natural extension. We study probability measures on the set of natural extensions of a causal set, especially those measures having the property of order-invariance: if we condition on the set of the bottom k elements of the natural extension, each feasible ordering among these k elements is equally likely. We give sufficient conditions for the existence and uniqueness of an order-invariant measure on the set of natural extensions of a causal set.

Cops and robbers is a turn-based pursuit game played on a graph G. One robber is pursued by a set of cops. In each round, these agents move between vertices along the edges of the graph. The cop number c(G) denotes the minimum number of cops required to catch the robber in finite time. We study the cop number of geometric graphs. For points x1, . . ., xn ∈ ℝ2, and r ∈ ℝ+, the vertex set of the geometric graph G(x1, . . ., xn; r) is the graph on these n points, with xi, xj adjacent when ∥xi − xj∥ ≤ r. We prove that c(G) ≤ 9 for any connected geometric graph G in ℝ2 and we give an example of a connected geometric graph with c(G) = 3. We improve on our upper bound for random geometric graphs that are sufficiently dense. Let (n,r) denote the probability space of geometric graphs with n vertices chosen uniformly and independently from [0,1]2. For G ∈ (n,r), we show that with high probability (w.h.p.), if r ≥ K1 (log n/n)1/4 then c(G) ≤ 2, and if r ≥ K2(log n/n)1/5 then c(G) = 1, where K1, K2 > 0 are absolute constants. Finally, we provide a lower bound near the connectivity regime of (n,r): if r ≤ K3 log n/ then c(G) > 1 w.h.p., where K3 > 0 is an absolute constant.

For each poset H whose Hasse diagram is a tree of height k, we show that the largest size of a family of subsets of [n]={1,. . ., n} not containing H as an induced subposet is asymptotic to . This extends a result of Bukh [1], which in turn generalizes several known results including Sperner's theorem.

A function f: 2n → {0,1} is odd-cycle-free if there are no x1,. . .,xk ∈ 2n with k an odd integer such that f(x1) = ··· = f(xk) = 1 and x1 + ··· + xk = 0. We show that one can distinguish odd-cycle-free functions from those ε-far from being odd-cycle-free by making poly(1/ε) queries to an evaluation oracle. We give two proofs of this result, each shedding light on a different connection between testability of properties of Boolean functions and of dense graphs.

The first issue we study is directly reducing testing of linear-invariant properties of Boolean functions to testing associated graph properties. We show a black-box reduction from testing odd-cycle-freeness to testing bipartiteness of graphs. Such reductions have already been shown (Král’, Serra and Vena, and Shapira) for monotone linear-invariant properties defined by forbidding solutions to a finite number of equations. But for odd-cycle-freeness whose description involves an infinite number of forbidden equations, a reduction to graph property testing was not previously known. If one could show such a reduction more generally for any linear-invariant property closed under restrictions to subspaces, then it would likely lead to a characterization of the one-sided testable linear-invariant properties, an open problem raised by Sudan.

The second issue we study is whether there is an efficient canonical tester for linear-invariant properties of Boolean functions. A canonical tester for linear-invariant properties operates by picking a random linear subspace and then checking whether the restriction of the input function to the subspace satisfies a fixed property. The question is if, for every linear-invariant property, there is a canonical tester for which there is only a polynomial blow-up from the optimal query complexity. We answer the question affirmatively for odd-cycle-freeness. The general question remains open.

In this paper we extend a classical theorem of Corrádi and Hajnal into the setting of sparse random graphs. We show that if p(n) ≫ (log n/n)1/2, then asymptotically almost surely every subgraph of G(n, p) with minimum degree at least (2/3 + o(1))np contains a triangle packing that covers all but at most O(p−2) vertices. Moreover, the assumption on p is optimal up to the (log n)1/2 factor and the presence of the set of O(p−2) uncovered vertices is indispensable. The main ingredient in the proof, which might be of independent interest, is an embedding theorem which says that if one imposes certain natural regularity conditions on all three pairs in a balanced 3-partite graph, then this graph contains a perfect triangle packing.

Scott conjectured in [6] that the class of graphs with no induced subdivision of a given graph is χ-bounded. We verify his conjecture for maximal triangle-free graphs.

We prove that the rescaled costs of partial match queries in a random two-dimensional quadtree converge almost surely towards a random limit which is identified as the terminal value of a martingale. Our approach shares many similarities with the theory of self-similar fragmentations.

We define a variant of the crossing number for an embedding of a graph G into ℝ3, and prove a lower bound on it which almost implies the classical crossing lemma. We also give sharp bounds on the rectilinear space crossing numbers of pseudo-random graphs.

We introduce a new graph polynomial that encodes interesting properties of graphs, for example, the number of matchings, the number of perfect matchings, and, for bipartite graphs, the number of independent sets (#BIS).

We analyse the complexity of exact evaluation of the polynomial at rational points and show a dichotomy result: for most points exact evaluation is #P-hard (assuming the generalized Riemann hypothesis) and for the rest of the points exact evaluation is trivial.

In the present paper we prove a certain lemma about the structure of ‘lower level-sets of convolutions’, which are sets of the form {x ∈ ℤN : 1A * 1A(x) ≤ γ N} or of the form {x ∈ ℤN : 1A(x) < γ N}, where A is a subset of ℤN. One result we prove using this lemma is that if |A| = θ N and |A+A| ≤ (1 − ϵ)N, 0 < ϵ < 1, then this level-set contains an arithmetic progression of length at least Nc, c = c(θ, ϵ, γ) > 0. It is perhaps possible to obtain such a result using Green's arithmetic regularity lemma (in combination with some ideas of Bourgain [6]); however, our method of proof allows us to obtain non-tower-type quantitative dependence between the constant c and the parameters θ and ϵ. For various reasons (discussed in the paper) one might think, wrongly, that such results would only be possible for level-sets involving triple and higher convolutions.

A tree T is said to be homogeneous if it is uniquely rooted and there exists an integer b ≥ 2, called the branching number of T, such that every t ∈ T has exactly b immediate successors. We study the behaviour of measurable events in probability spaces indexed by homogeneous trees.

Precisely, we show that for every integer b ≥ 2 and every integer n ≥ 1 there exists an integer q(b,n) with the following property. If T is a homogeneous tree with branching number b and {At:t ∈ T} is a family of measurable events in a probability space (Ω,Σ,μ) satisfying μ(At)≥ϵ>0 for every t ∈ T, then for every 0<θ<ϵ there exists a strong subtree S of T of infinite height, such that for every finite subset F of S of cardinality n ≥ 1 we have In fact, we can take q(b,n)= ((2b−1)2n−1−1)·(2b−2)−1. A finite version of this result is also obtained.

We study distance properties of a general class of random directed acyclic graphs (dags). In a dag, many natural notions of distance are possible, for there exist multiple paths between pairs of nodes. The distance of interest for circuits is the maximum length of a path between two nodes. We give laws of large numbers for the typical depth (distance to the root) and the minimum depth in a random dag. This completes the study of natural distances in random dags initiated (in the uniform case) by Devroye and Janson. We also obtain large deviation bounds for the minimum of a branching random walk with constant branching, which can be seen as a simplified version of our main result.

Li, Nikiforov and Schelp [13] conjectured that any 2-edge coloured graph G with order n and minimum degree δ(G) > 3n/4 contains a monochromatic cycle of length ℓ, for all ℓ ∈ [4, ⌈n/2⌉]. We prove this conjecture for sufficiently large n and also find all 2-edge coloured graphs with δ(G)=3n/4 that do not contain all such cycles. Finally, we show that, for all δ>0 and n>n0(δ), if G is a 2-edge coloured graph of order n with δ(G) ≥ 3n/4, then one colour class either contains a monochromatic cycle of length at least (2/3+δ/2)n, or contains monochromatic cycles of all lengths ℓ ∈ [3, (2/3−δ)n].