For a fixed graph $H$, we define the rainbow Turán number $\ex^*(n,H)$ to be the maximum number of edges in a graph on $n$ vertices that has a proper edge-colouring with no rainbow $H$. Recall that the (ordinary) Turán number $\ex(n,H)$ is the maximum number of edges in a graph on $n$ vertices that does not contain a copy of $H$. For any non-bipartite $H$ we show that $\ex^*(n,H)=(1+o(1))\ex(n,H)$, and if $H$ is colour-critical we show that $\ex^{*}(n,H)=\ex(n,H)$. When $H$ is the complete bipartite graph $K_{s,t}$ with $s \leq t$ we show $\ex^*(n,K_{s,t}) = O(n^{2-1/s})$, which matches the known bounds for $\ex(n,K_{s,t})$ up to a constant. We also study the rainbow Turán problem for even cycles, and in particular prove the bound $\ex^*(n,C_6) = O(n^{4/3})$, which is of the correct order of magnitude.

A family of subsets of an n-set is 2-cancellative if, for every four-tuple {A, B, C, D} of its members, A∪ B∪C=A∪ B∪ D implies C = D. This generalizes the concept of cancellative set families, defined by the property that A∪B ≠A ∪ C for A, B, C all different. The asymptotics of the maximum size of cancellative families of subsets of an n-set is known (Tolhuizen [7]). We provide a new upper bound on the size of 2-cancellative families, improving the previous bound of 20.458n to 20.42n.

Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that, for both i = 1, 2, we have . This gives an approximate answer to a question of Bollobás and Scott. We also prove results about partitions into more than two vertex classes. Our proofs yield polynomial algorithms.

This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weights are uniformly distributed over [0,1]. An algorithm receives the edges one by one and has to decide immediately whether to include the current edge into the spanning tree or to reject it. The corresponding edge sequence is determined by some adversary. We propose an algorithm which achieves $\mathbb{E}[ALG]/\mathbb{E}[OPT]=O(1)$ and $\mathbb{E}[ALG/OPT]=O(1)$ against a fair adaptive adversary, i.e., an adversary which determines the edge order online and is fair in a sense that he does not know more about the edge weights than the algorithm. Furthermore, we prove that no online algorithm performs better than $\mathbb{E}[ALG]/\mathbb{E}[OPT]=\Omega(\log n)$ if the adversary knows the edge weights in advance. This lower bound is tight, since there is an algorithm which yields $\mathbb{E}[ALG]/\mathbb{E}[OPT]=O(\log n)$ against the strongest-imaginable adversary.

Let d ≥ d0 be a sufficiently large constant. An graph G is a d-regular graph over n vertices whose second-largest (in absolute value) eigenvalue is at most . For any 0<p<1, Gp is the graph induced by retaining each edge of G with probability p. It is known that for the graph Gp almost surely contains a unique giant component (a connected component with linear number vertices). We show that for the giant component of Gp almost surely has an edge expansion of at least .

Let S be a finite set of integers. We consider a problem of finding D(S), the minimum size of a set A, such that S⊆ A−A. We give a characterization for ‘extremal’ sets and prove lower and upper bounds on D(S) in terms of additive properties of S.

In this paper we prove polynomial versions of the Carlson–Simpson theorem and the Graham–Rothschild theorem on parameter sets. To do so we prove a useful extension of the polynomial Hales–Jewett theorem.

We describe how non-crossing partitions arise in substitution method calculations. By using efficient algorithms for computing non-crossing partitions we are able to substantially reduce the computational effort, which enables us to compute improved bounds on the percolation thresholds for three percolation models. For the Kagomé bond model we improve bounds from 0.5182 ≤ pc ≤ 0.5335 to 0.522197 ≤ pc ≤ 0.526873, improving the range from 0.0153 to 0.004676. For the (3, 122) bond model we improve bounds from 0.7393 ≤ pc ≤ 0.7418 to 0.739773 ≤ pc ≤ 0.741125, improving the range from 0.0025 to 0.001352. We also improve the upper bound for the hexagonal site model, from 0.794717 to 0.743359.

In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular graph asymptotically almost surely (a.a.s.) has chromatic number 4 and that the chromatic number of a random d-regular graph for other d between 5 and 10 inclusive is a.a.s. restricted to a range of two integer values: {3, 4} for d = 5, {4, 5} for d = 7, 8, 9, and {5, 6} for d = 10. The proof uses efficient algorithms which a.a.s. colour these random graphs using the number of colours specified by the upper bound. These algorithms are analysed using the differential equation method, including an analysis of certain systems of differential equations with discontinuous right-hand sides.

For an integer $b \geq 1$, the $b$-choice number of a graph $G$ is the minimum integer $k$ such that, for every assignment of a set $S(v)$ of at least $k$ colours to each vertex $v$ of $G$, there is a $b$-set colouring of $G$ that assigns to each vertex $v$ a $b$-set $B(v) \subseteq S(v) \; (|B(v)|=b)$ so that adjacent vertices receive disjoint $b$-sets. This is a generalization of the notions of choice number and chromatic number of a graph. Using probabilistic arguments, we show that, for some positive constant $c > 0$ (independent of $b$), the $b$-choice number of any graph $G$ on $n$ vertices is at most $c (b\chi) (\ln (n/\chi)+1)$ where $\chi = \chi(G)$ denotes the chromatic number of $G$. For any fixed $b$, this bound is tight up to a constant factor for each $n,\chi$. This generalizes and extends a result of Noga Alon [1]wherein a similar bound was obtained for 1-choice numbers of complete $\chi$-partite graphs with each part having size $n/\chi$. We also show that the proof arguments are constructive, leading to polynomial time algorithms for the list colouring problem on certain classes of graphs, provided each vertex is given a list of sufficiently large size.

We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3-colours a random 4-regular graph. The analysis includes use of the differential equation method, and exponential bounds on the tail of random variables associated with branching processes. A substantial part of the analysis applies to random d-regular graphs in general.

We consider relations between thresholds for monotone set properties and simple lower bounds for such thresholds. A motivating example (Conjecture 2): Given an n-vertex graph H, write pE for the least p such that, for each subgraph H' of H, the expected number of copies of H' in G=G(n, p) is at least 1, and pc for that p for which the probability that G contains (a copy of) H is 1/2. Then (conjecture) pc=O(pElog n). Possible connections with discrete isoperimetry are also discussed.

Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t such that, for any graph with n vertices, m edges, and independence number 2, at least t edges can be packed with edge-disjoint copies of Kk. Turán's theorem together with Wilson's Theorem assert that if . A conjecture of Erdős states that for all plausible m. For any ε > 0, this conjecture was open even if . Generally, f_k(n,m) may be significantly smaller than . Indeed, for k=7 it is easy to show that for m ≈ 0.3n2. Nevertheless, we prove the following result. For every k≥ 3 there exists γ>0 such that if then . In the special case k=3 we obtain the reasonable bound γ ≥ 10−4. In particular, the above conjecture of Erdős holds whenever G has fewer than 0.2501n2 edges.

We answer three questions posed in a paper by Babson and Benjamini. They introduced a parameter $C_G$ for Cayley graphs $G$ that has significant application to percolation. For a minimal cutset of $G$ and a partition of this cutset into two classes, take the minimal distance between the two classes. The supremum of this number over all minimal cutsets and all partitions is $C_G$. We show that if it is finite for some Cayley graph of the group then it is finite for any (finitely generated) Cayley graph. Having an exponential bound for the number of minimal cutsets of size $n$ separating $o$ from infinity also turns out to be independent of the Cayley graph chosen. We show a 1-ended example (the lamplighter group), where $C_G$ is infinite. Finally, we give a new proof for a question of de la Harpe, proving that the number of $n$-element cutsets separating $o$ from infinity is finite unless $G$ is a finite extension of $\mathbb{Z}$.

We say that $n$-vertex graphs $G_1,G_2,\ldots,G_k$pack if there exist injective mappings of their vertex sets onto $[n] = \{1, \ldots,n \}$ such that the images of the edge sets do not intersect. The notion of packing allows one to make some problems on graphs more natural or more general. Clearly, two $n$-vertex graphs $G_1$ and $G_2$ pack if and only if $G_1$ is a subgraph of the complement $\overline{G}_2$ of $G_2$.