An (r,r+1)-factor of a graph G is a spanning subgraph H such that dH(v)∈{r,r+1} for all vertices v∈𝒱(G). If G is expressed as the union of edge-disjoint (r,r+1)-factors, then this expression is an (r,r+1)-factorization of G. Let μ(r) be the smallest integer with the property that if G is a regular loopless multigraph of degree d with d≥μ(r), then G has an (r,r+1)-factorization. It is shown that if r is even. The proof employs a novel list-coloring approach. Together with known results, this shows that μ(r)=r2+1 if r is odd and if r is even.

We prove that for any given integer c≥0 any metric space on n points may be isometrically embedded into ln−c∞ provided n is large enough.

Interactions between a finite number of bodies and the surrounding fluid, in a channel for instance, are investigated theoretically. In the planar model here the bodies or modelled grains are thin solid bodies free to move in a nearly parallel formation within a quasi-inviscid fluid. The investigation involves numerical and analytical studies and comparisons. The three main features that appear are a linear instability about a state of uniform motion, a clashing of the bodies (or of a body with a side wall) within a finite scaled time when nonlinear interaction takes effect, and a continuum-limit description of the body–fluid interaction holding for the case of many bodies.

Let K be a convex body and let p0∈int K. Suppose that in every direction we can choose continuously a section of K which is a translated copy of the corresponding parallel section of K through p0. Our main result essentially claims that if all these pairs of sections are different almost everywhere, then K is an ellipsoid.

Carathéodory’s theorem on small witnesses for convex hulls of sets is shown to have a natural analogue for finitely supported measures. Contrast is drawn with the much larger witnesses required for multisets, as shown by Bárány and Perles.

It is well known that a tournament (complete oriented graph) on n vertices has at most directed triangles, and that the constant is best possible. Motivated by some geometric considerations, our aim in this paper is to consider some “higher order” versions of this statement. For example, if we give each 3-set from an n-set a cyclic ordering, then what is the greatest number of “directed 4-sets” we can have? We give an asymptotically best possible answer to this question, and give bounds in the general case when we orient each d-set from an n-set.

We prove that there are permutation classes (hereditary properties of permutations) of every growth rate (Stanley–Wilf limit) at least λ≈2.48187, the unique real root of x5−2x4−2x2−2x−1, thereby establishing a conjecture of Albert and Linton.