The study of extremal problems related to independent sets in hypergraphs is a problem that has generated much interest. There are a variety of types of independent sets in hypergraphs depending on the number of vertices from an independent set allowed in an edge. We say that a subset of vertices is j-independent if its intersection with any edge has size strictly less than j. The Kruskal–Katona theorem implies that in an r-uniform hypergraph with a fixed size and order, the hypergraph with the most r-independent sets is the lexicographic hypergraph. In this paper, we use a hypergraph regularity lemma, along with a technique developed by Loh, Pikhurko and Sudakov, to give an asymptotically best possible upper bound on the number of j-independent sets in an r-uniform hypergraph.

We consider an optimal control problem based on the evolutionary game theory model introduced by Short et al. (Short, M. B., Brantingham, P. J. & D'Orsogna, M. R. (2010) Cooperation and punishment in an adversarial game: How defectors pave the way to a peaceful society. Phys. Rev. E82(6), 066114.1–066114.7) to study societal attitudes in relation to committing and reporting crimes. Since in [26] (Short, M. B., Brantingham, P. J. & D'Orsogna, M. R. Cooperation and punishment in an adversarial game: How defectors pave the way to a peaceful society. Phys. Rev. E82(6), 066114.1–066114.7) it is shown that the presence of criminal informants leads to diminishing crime, in this paper we investigate the active recruitment of informants from the general population via external intervention, albeit at a cost to society. While higher recruitment levels may be the most beneficial in abating crime, these are also more expensive. We thus formulate our optimal control problem to account for finite resources, incurred costs and expected benefits, and determine the most favourable recruitment strategy under given constraints. We consider the cases of targeted and untargeted recruitment, and allow recruitment costs to depend on past cumulative payoffs within a given memory time-frame so that conversion of more successful individuals may be more costly than that of less successful ones. Our optimal control problem is expressed via three control functions subject to a system of delay differential equations, and is numerically solved, analysed and discussed under different settings and in different parameter regimes. We find that the optimal strategy can change drastically and abruptly as parameters and resource constraints vary, and that increased information on individual player strategies leads to only slightly decreased minimal costs.

It is well known that an intersecting family of subsets of an n-element set can contain at most 2n−1 sets. It is natural to wonder how ‘close’ to intersecting a family of size greater than 2n−1 can be. Katona, Katona and Katona introduced the idea of a ‘most probably intersecting family’. Suppose that is a family and that 0 < p < 1. Let (p) be the (random) family formed by selecting each set in independently with probability p. A family is most probably intersecting if it maximizes the probability that (p) is intersecting over all families of size ||.

Katona, Katona and Katona conjectured that there is a nested sequence consisting of most probably intersecting families of every possible size. We show that this conjecture is false for every value of p provided that n is sufficiently large.

The discrete cube {0, 1}d is a fundamental combinatorial structure. A subcube of {0, 1}d is a subset of 2k of its points formed by fixing k coordinates and allowing the remaining d − k to vary freely. This paper is concerned with patterns of intersections among subcubes of the discrete cube. Two sample questions along these lines are as follows: given a family of subcubes in which no r + 1 of them have non-empty intersection, how many pairwise intersections can we have? How many subcubes can we have if among them there are no k which have non-empty intersection and no l which are pairwise disjoint?

These questions are naturally expressed using intersection graphs. The intersection graph of a family of sets has one vertex for each set in the family with two vertices being adjacent if the corresponding subsets intersect. Let $\I(n,d)$ be the set of all n vertex graphs which can be represented as the intersection graphs of subcubes in {0, 1}d. With this notation our first question above asks for the largest number of edges in a Kr+1-free graph in $\I(n,d)$. As such it is a Turán-type problem. We answer this question asymptotically for some ranges of r and d. More precisely we show that if $(k+1)2^{\lfloor\frac{d}{k+1}\rfloor}<n\leq k2^{\lfloor\frac{d}{k}\rfloor}$ for some integer k ≥ 2 then the maximum edge density is $\bigl(1-\frac{1}{k}-o(1)\bigr)$ provided that n is not too close to the lower limit of the range.

The second question can be thought of as a Ramsey-type problem. The maximum such n can be defined in the same way as the usual Ramsey number but only considering graphs which are in $\I(n,d)$. We give bounds for this maximum n mainly concentrating on the case that l is fixed, and make some comparisons with the usual Ramsey number.

The study of the phase transition of random graph processes, and recently in particular Achlioptas processes, has attracted much attention. Achlioptas, D'Souza and Spencer (Science, 2009) gave strong numerical evidence that a variety of edge-selection rules in Achlioptas processes exhibit a discontinuous phase transition. However, Riordan and Warnke (Science, 2011) recently showed that all these processes have a continuous phase transition.

In this work we prove discontinuous phase transitions for three random graph processes: all three start with the empty graph on n vertices and, depending on the process, we connect in every step (i) one vertex chosen randomly from all vertices and one chosen randomly from a restricted set of vertices, (ii) two components chosen randomly from the set of all components, or (iii) a randomly chosen vertex and a randomly chosen component.

Böttcher, Schacht and Taraz (Math. Ann., 2009) gave a condition on the minimum degree of a graph G on n vertices that ensures G contains every r-chromatic graph H on n vertices of bounded degree and of bandwidth o(n), thereby proving a conjecture of Bollobás and Komlós (Combin. Probab. Comput., 1999). We strengthen this result in the case when H is bipartite. Indeed, we give an essentially best-possible condition on the degree sequence of a graph G on n vertices that forces G to contain every bipartite graph H on n vertices of bounded degree and of bandwidth o(n). This also implies an Ore-type result. In fact, we prove a much stronger result where the condition on G is relaxed to a certain robust expansion property. Our result also confirms the bipartite case of a conjecture of Balogh, Kostochka and Treglown concerning the degree sequence of a graph which forces a perfect H-packing.

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.

Topology of two-dimensional flow associated with degenerate dividing streamline on a free surface is analysed from a topological point of view by considering the critical point concept. Streamline patterns and their bifurcations in the vicinity of a free surface were investigated by Brøns (Brøns, M. (1994) Topological fluid dynamics of interfacial flows. Phys. Fluids6, 2730–2736). Brøns's work is extended to the case of a stream function, including the fourth-order normal form approach. From this, a complete description of bifurcations which can occur in two-dimensional incompressible flow is obtained up to codimension three. The theory is applied to the patterns found numerically in a roll coater.

We investigate the motion of two immiscible fluids in a porous medium described by a two-phase flow system. In the capillary pressure relation, we include static and dynamic hysteresis. The model is well established in the context of the Richards equation, which is obtained by assuming a constant pressure for one of the two phases. We derive an existence result for this hysteresis two-phase model for non-degenerate permeability and capillary pressure curves. A discretization scheme is introduced and numerical results for fingering experiments are obtained. The main analytical tool is a compactness result for two variables that are coupled by a hysteresis relation.

Let p ∈ (1, ∞) and let Ω ⊆ ℝN be a bounded domain with Lipschitz continuous boundary. We characterize on L2(Ω) all order-preserving semigroups that are generated by convex, lower semicontinuous, local functionals and are sandwiched between the semigroups generated by the p-Laplace operator with Dirichlet and Neumann boundary conditions. We show that every such semigroup is generated by the p-Laplace operator with Robin-type boundary conditions.

This work is dedicated to the resolution of a singular equation set in the half-space, with a diffusion coefficient that blows up on the boundary. More precisely, for a datum g: ℝ+3 → ℝ, our problem involves seeking u: ℝ+3 → ℝ as a formal solution to

We give existence and uniqueness results of weak and strong solutions in suitable weighted spaces, where the weight depends on x3.

We establish that the maximal operator and the Littlewood–Paley g-function associated with the heat semigroup defined by multidimensional Bessel operators are of weak type (1, 1). We also prove that Riesz transforms in the multidimensional Bessel setting are of strong type (p, p), for every 1 < p < ∞, and of weak type (1, 1).

We provide new sufficient conditions for the existence of multiple fixed points for a map between ordered Banach spaces. An interesting feature of this approach is that we require conditions not on two boundaries, but rather on one boundary and a point with some extra information on the monotonicity of the nonlinearity on a certain set. We apply our results to prove the existence of at least two positive solutions for a nonlinear boundary-value problem that models a thermostat.

We determine the critical coupling of the two-dimensional Brown–Ravenhall operator with Coulomb potential. Boundedness from below has essentially been proven by Bouzouina. However, that work contains a trivial error leading to an incorrect constant that is exactly half of the actual critical constant. Furthermore, we show that the operator is in fact positive. Our proof of that is, for the most part, analogous to Tix's proof of the corresponding result for the three-dimensional operator.

We study the inhomogeneous semilinear parabolic equation

with source term f independent of time and subject to f(x) ≥ 0 and with u(0, x) = φ(x) ≥ 0, for the very general setting of a metric measure space. By establishing Harnack-type inequalities in time t and some powerful estimates, we give sufficient conditions for non-existence, local existence and global existence of weak solutions, depending on the value of p relative to a critical exponent.