In a uniform random recursive$k$-directed acyclic graph, there is a root, 0, and each node in turn, from 1 to$n$, chooses$k$uniform random parents from among the nodes of smaller index. If$S$_{$n$}is the shortest path distance from node$n$to the root, then we determine the constant$σ$such that$S$_{$n$}/log$n$→$σ$in probability as$n$→∞. We also show that max_{1≤$i$≤$n$}$S$_{$i$}/log$n$→$σ$in probability.

General upper tail estimates are given for counting edges in a random induced subhypergraph of a fixed hypergraph ℋ, with an easy proof by estimating the moments. As an application we consider the numbers of arithmetic progressions and Schur triples in random subsets of integers. In the second part of the paper we return to the subgraph counts in random graphs and provide upper tail estimates in the rooted case.

In this paper, we consider the continuity property of pseudo-differential operators with symbols whose Fourier transforms have compact support. As applications, we obtain the$L$^{$p$}-boundedness for symbols in Besov spaces and in modulation spaces.

It is shown that for any$t$, 0<$t$<∞, there is a Jordan arc Γ with endpoints 0 and 1 such that $\Gamma\setminus\{1\}\subseteq\mathbb{D}:=\{z:|z|<1\}$ and with the property that the analytic polynomials are dense in the Bergman space $\mathbb{A}^{t}(\mathbb{D}\setminus\Gamma)$ . It is also shown that one can go further in the Hardy space setting and find such a Γ that is in fact the graph of a continuous real-valued function on [0,1], where the polynomials are dense in $H^{t}(\mathbb{D}\setminus\Gamma)$ ; improving upon a result in an earlier paper.

A simplicial complex Δ is called$flag$if all minimal nonfaces of Δ have at most two elements. The following are proved: First, if Δ is a flag simplicial pseudomanifold of dimension$d$−1, then the graph of Δ (i) is (2$d$−2)-vertex-connected and (ii) has a subgraph which is a subdivision of the graph of the$d$-dimensional cross-polytope. Second, the$h$-vector of a flag simplicial homology sphere Δ of dimension$d$−1 is minimized when Δ is the boundary complex of the$d$-dimensional cross-polytope.