Colmez has given a recipe to associate a smooth modular representation Ω(W) of the Borel subgroup of GL2(Qp) to a -representation W of by using Fontaine’s theory of (φ,Γ)-modules. We compute Ω(W) explicitly and we prove that if W is irreducible and dim (W)=2, then Ω(W) is the restriction to the Borel subgroup of GL2(Qp) of the supersingular representation associated to W by Breuil’s correspondence.

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.

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.

Let K n denote the number of types of a sample of size n taken from an exchangeable coalescent process (Ξ-coalescent) with mutation. A distributional recursion for the sequence (K n )n∈ℕ is derived. If the coalescent does not have proper frequencies, i.e. if the characterizing measure Ξ on the infinite simplex Δ does not have mass at 0 and satisfies ∫Δ ∣x∣Ξ(dx)/(x,x)<∞, where ∣x∣:=∑i=1 ∞x i and (x,x)≔∑i=1 ∞x i 2 for x=(x 1,x 2,…)∈Δ, then K n /n converges weakly as n→∞ to a limiting variable K that is characterized by an exponential integral of the subordinator associated with the coalescent process. For so-called simple measures Ξ satisfying ∫ΔΞ(d x)/(x,x)<∞, we characterize the distribution of K via a fixed-point equation.

In this paper we focus on the problem of the degree sequence for a random graph process with edge deletion. We prove that, while a specific parameter varies, the limit degree distribution of the model exhibits critical phenomenon.

Let p be a prime. We say that a transitive action of a group L on a set Ω is p-sub-regular if there exist x,y∈Ω such that 〈Lx,Ly〉=L and LYx≅ℤp, where Y =yLx is the orbit of y under Lx. Our main result is that if Γ is a G-arc-transitive graph and the permutation group induced by the action of Gv on Γ(v) is p-sub-regular, then the order of a G-arc-stabilizer is equal to ps−1 where s≤7, s≠6, and moreover, if p=2, then s≤5. This generalizes a classical result of Tutte on cubic arc-transitive graphs as well as some more recent results. We also give a characterization of p-sub-regular actions in terms of arc-regular actions on digraphs and discuss some interesting examples of small degree.

In this paper we consider a stochastic SIR (susceptible→infective→removed) epidemic model in which individuals may make infectious contacts in two ways, both within ‘households’ (which for ease of exposition are assumed to have equal size) and along the edges of a random graph describing additional social contacts. Heuristically motivated branching process approximations are described, which lead to a threshold parameter for the model and methods for calculating the probability of a major outbreak, given few initial infectives, and the expected proportion of the population who are ultimately infected by such a major outbreak. These approximate results are shown to be exact as the number of households tends to infinity by proving associated limit theorems. Moreover, simulation studies indicate that these asymptotic results provide good approximations for modestly sized finite populations. The extension to unequal-sized households is discussed briefly.

Large deviation principles and related results are given for a class of Markov chains associated to the ‘leaves' in random recursive trees and preferential attachment random graphs, as well as the ‘cherries’ in Yule trees. In particular, the method of proof, combining analytic and Dupuis–Ellis-type path arguments, allows for an explicit computation of the large deviation pressure.

Let G be a simple undirected graph. The energy E(G) of G is the sum of the absolute values of the eigenvalues of the adjacent matrix of G, and the Hosoya index Z(G) of G is the total number of matchings in G. A tree is called a nonconjugated tree if it contains no perfect matching. Recently, Ou [‘Maximal Hosoya index and extremal acyclic molecular graphs without perfect matching’, Appl. Math. Lett.19 (2006), 652–656] determined the unique element which is maximal with respect to Z(G) among the family of nonconjugated n-vertex trees in the case of even n. In this paper, we provide a counterexample to Ou’s results. Then we determine the unique maximal element with respect to E(G) as well as Z(G) among the family of nonconjugated n-vertex trees for the case when n is even. As corollaries, we determine the maximal element with respect to E(G) as well as Z(G) among the family of nonconjugated chemical trees on n vertices, when n is even.

Let ℳ be a regular map of genus g>1 and X be the underlying Riemann surface. A reflection of ℳ fixes some simple closed curves on X, which we call mirrors. Each mirror passes through at least two of the geometric points (vertices, face-centers and edge-centers) of ℳ. In this paper we study the surfaces which contain mirrors passing through just two geometric points, and show that only Wiman surfaces have this property.

We prove that n-hypergraphs can be interpreted in e-free perfect PAC fields in particular in pseudofinite fields. We use methods of function field arithmetic, more precisely we construct generic polynomials with alternating groups as Galois groups over a function field.

A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper we show that there exists a one-regular cubic graph of order 2p or 2p2 where p is a prime if and only if 3 is a divisor of p – 1 and the graph has order greater than 25. All of those one-regular cubic graphs are Cayley graphs on dihedral groups and there is only one such graph for each fixed order. Surprisingly, it can be shown that there is no one-regular cubic graph of order 4p or 4p2.

We contine our study of the following combinatorial problem: What is the largest integer N = N (t, m, p) for which there exists a set of N people satisfying the following conditions: (a) each person speaks t languages, (b) among any m people there are two who speak a common language and (c) at most p speak a common language. We obtain bounds for N(t, m, p) and evaluate N(3, m, p) for all m and infintely many values of p.

We show that the complete symmetric digraph DKn, n≧5, can be decomposed into each of the four oriented pentagons if and only if n ≡ 0 or 1 (mod 5).

A chordal graph is a graph in which every cycle of length at least 4 has a chord. If G is a random n-vertex labelled chordal graph, the size of the larget clique in about n/2 and deletion of this clique almost surely leaves only isolated vertices. This gives the asymptotic number of chordal graphs and information about a variety of things such as the size of the largest clique and connectivity.

An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs in the graph. A graph is s-regular if its full automorphism group is s-regular. For a connected cubic symmetric graph X of order 2pn for an odd prime p, we show that if p ≠ 5, 7 then every Sylow p-subgroup of the full automorphism group Aut(X) of X is normal, and if p ≠3 then every s-regular subgroup of Aut(X) having a normal Sylow p-subgroup contains an (s − 1)-regular subgroup for each 1 ≦ s ≦ 5. As an application, we show that every connected cubic symmetric graph of order 2pn is a Cayley graph if p > 5 and we classify the s-regular cubic graphs of order 2p2 for each 1≦ s≦ 5 and each prime p. as a continuation of the authors' classification of 1-regular cubic graphs of order 2p2. The same classification of those of order 2p is also done.

John W. Moon has discovered several computational errors in our article above (J. Austral. Math. Soc. (Series A) 20 (1975), 483–503). The five constants reported for identity trees below Table 1 at the bottom of page 502 are all wrong. The correct values are