It is well known that a graph with m edges can be made triangle-free by removing (slightly less than) m/2 edges. On the other hand, there are many classes of graphs which are hard to make triangle-free, in the sense that it is necessary to remove roughly m/2 edges in order to eliminate all triangles.

We prove that dense graphs that are hard to make triangle-free have a large packing of pairwise edge-disjoint triangles. In particular, they have more than m(1/4+cβ) pairwise edge-disjoint triangles where β is the density of the graph and c ≥ is an absolute constant. This improves upon a previous m(1/4−o(1)) bound which follows from the asymptotic validity of Tuza's conjecture for dense graphs. We conjecture that such graphs have an asymptotically optimal triangle packing of size m(1/3−o(1)).

We extend our result from triangles to larger cliques and odd cycles.

In 1965 Erdős conjectured a formula for the maximum number of edges in a k-uniform n-vertex hypergraph without a matching of size s. We prove this conjecture for k = 3 and all s ≥ 1 and n ≥ 4s.

A colouring of the vertices of a hypergraph is called conflict-free if each edge e of contains a vertex whose colour does not repeat in e. The smallest number of colours required for such a colouring is called the conflict-free chromatic number of , and is denoted by χCF(). Pach and Tardos proved that for an (2r − 1)-uniform hypergraph with m edges, χCF() is at most of the order of rm1/r log m, for fixed r and large m. They also raised the question whether a similar upper bound holds for r-uniform hypergraphs. In this paper we show that this is not necessarily the case. Furthermore, we provide lower and upper bounds on the minimum number of edges of an r-uniform simple hypergraph that is not conflict-free k-colourable.

We discuss the connection between the expansion of small sets in graphs, and the Schatten norms of their adjacency matrices. In conjunction with a variant of the Azuma inequality for uniformly smooth normed spaces, we deduce improved bounds on the small-set isoperimetry of Abelian Alon–Roichman random Cayley graphs.

In this paper, we consider pairs of forbidden subgraphs that imply the existence of a 2-factor in a graph. For d ≥ 2, let d be the set of connected graphs of minimum degree at least d. Let F1 and F2 be connected graphs and let be a set of connected graphs. Then {F1, F2} is said to be a forbidden pair for if every {F1, F2}-free graph in of sufficiently large order has a 2-factor. Faudree, Faudree and Ryjáček have characterized all the forbidden pairs for the set of 2-connected graphs. We first characterize the forbidden pairs for 2, which is a larger set than the set of 2-connected graphs, and observe a sharp difference between the characterized pairs and those obtained by Faudree, Faudree and Ryjáček. We then consider the forbidden pairs for connected graphs of large minimum degree. We prove that if {F1, F2} is a forbidden pair for d, then either F1 or F2 is a star of order at most d + 2. Ota and Tokuda have proved that every -free graph of minimum degree at least d has a 2-factor. These results imply that for k ≥ d + 2, no connected graphs F except for stars of order at most d + 2 make {K1,k, F} a forbidden pair for d, while for every connected graph F makes {K1,k, F} a forbidden pair for d. We consider the remaining range of , and prove that only a finite number of connected graphs F make {K1,k, F} a forbidden pair for d.

A family of sets (and the corresponding family of 0–1 vectors) is called t-cancellative if, for all distinct t + 2 members A1,. . ., At and B, C ∈ , Let ct(n) be the size of the largest t-cancellative family on n elements, and let ct(n, r) denote the largest r-uniform family. We improve the previous upper bounds, e.g., we show c2(n) ≤ 20.322n (for n > n0). Using an algebraic construction we show that c2(n, 2k) = Θ(nk) for each k when n → ∞.

We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that converge to the same limit, and such that a Hamiltonian cycle in one of them has a limit that is not approximable by any subgraph of the other. We give an example where this holds, but convergence is meant in a stronger sense. This is related to whether having a Hamiltonian cycle is a testable graph property.

R. H. Schelp conjectured that if G is a graph with |V(G)| = R(Pn, Pn) such that δ(G) > , then in every 2-colouring of the edges of G there is a monochromatic Pn. In other words, the Ramsey number of a path does not change if the graph to be coloured is not complete but has large minimum degree.

Here we prove Ramsey-type results that imply the conjecture in a weakened form, first replacing the path by a matching, showing that the star-matching–matching Ramsey number satisfying R(Sn, nK2, nK2) = 3n − 1. This extends R(nK2, nK2) = 3n − 1, an old result of Cockayne and Lorimer. Then we extend this further from matchings to connected matchings, and outline how this implies Schelp's conjecture in an asymptotic sense through a standard application of the Regularity Lemma.

It is sad that we are unable to hear Dick Schelp's reaction to our work generated by his conjecture.

Upper and lower bounds are proved for the maximum number of triangles in C2k+1-free graphs. The bounds involve extremal numbers related to appropriate even cycles.

Recently, the authors gave upper bounds for the size of 3-uniform hypergraphs avoiding a given odd cycle using the definition of a cycle due to Berge. In the present paper we extend this bound to m-uniform hypergraphs (for all m ≥ 3), as well as m-uniform hypergraphs avoiding a cycle of length 2k. Finally we consider non-uniform hypergraphs avoiding cycles of length 2k or 2k + 1. In both cases we can bound |h| by O(n1+1/k) under the assumption that all h ∈ ε() satisfy |h| ≥ 4k2.

Let k and ℓ be positive integers. With a graph G, we associate the quantity ck,ℓ(G), the number of k-colourings of the edge set of G with no monochromatic matching of size ℓ. Consider the function ck,ℓ: given by ck,ℓ(n) = max {ck,ℓ(G): |V(G)| = n}, the maximum of ck,ℓ(G) over all graphs G on n vertices. In this paper, we determine ck,ℓ(n) and the corresponding extremal graphs for all large n and all fixed values of k and ℓ.

Let be a family of subsets of an n-element set. It is called intersecting if every pair of its members has a non-disjoint intersection. It is well known that an intersecting family satisfies the inequality || ≤ 2n−1. Suppose that ||=2n−1 + i. Choose the members of independently with probability p (delete them with probability 1 − p). The new family is intersecting with a certain probability. We try to maximize this probability by choosing appropriately. The exact maximum is determined in this paper for some small i. The analogous problem is considered for families consisting of k-element subsets, but the exact solution is obtained only when the size of the family exceeds the maximum size of the intersecting family only by one. A family is said to be inclusion-free if no member is a proper subset of another one. It is well known that the largest inclusion-free family is the one consisting of all -element subsets. We determine the most probably inclusion-free family too, when the number of members is .