We say a graph is (Qn,Qm)-saturated if it is a maximal Qm-free subgraph of the n-dimensional hypercube Qn. A graph is said to be (Qn,Qm)-semi-saturated if it is a subgraph of Qn and adding any edge forms a new copy of Qm. The minimum number of edges a (Qn,Qm)-saturated graph (respectively (Qn,Qm)-semi-saturated graph) can have is denoted by sat(Qn,Qm) (respectively s-sat(Qn,Qm)). We prove that

$$ \begin{linenomath} \lim_{n\to\infty}\ffrac{\sat(Q_n,Q_m)}{e(Q_n)}=0, \end{linenomath}$$

$$ \begin{linenomath} \ssat(Q_n,Q_m)\geq \ffrac{m+1}{2}\cdot 2^n, \end{linenomath}$$

Let G be an abelian group of cardinality n, where hcf(n, 6) = 1, and let A be a random subset of G. Form a graph ΓA on vertex set G by joining x to y if and only if x + y ∈ A. Then, with high probability as n → ∞, the chromatic number χ(ΓA) is at most $(1 + o(1))\tfrac{n}{2\log_2 n}$. This is asymptotically sharp when G = ℤ/nℤ, n prime.

For a given graph G of minimum degree at least k, let Gp denote the random spanning subgraph of G obtained by retaining each edge independently with probability p = p(k). We prove that if p ⩾ (logk + loglogk + ωk(1))/k, where ωk(1) is any function tending to infinity with k, then Gp asymptotically almost surely contains a cycle of length at least k + 1. When we take G to be the complete graph on k + 1 vertices, our theorem coincides with the classic result on the threshold probability for the existence of a Hamilton cycle in the binomial random graph.

Let r and d be positive integers with r<d. Consider a random d-ary tree constructed as follows. Start with a single vertex, and in each time-step choose a uniformly random leaf and give it d newly created offspring. Let 𝒯d,t be the tree produced after t steps. We show that there exists a fixed δ<1 depending on d and r such that almost surely for all large t, every r-ary subtree of 𝒯d,t has less than t δ vertices. The proof involves analysis that also yields a related result. Consider the following iterative construction of a random planar triangulation. Start with a triangle embedded in the plane. In each step, choose a bounded face uniformly at random, add a vertex inside that face and join it to the vertices of the face. In this way, one face is destroyed and three new faces are created. After t steps, we obtain a random triangulated plane graph with t+3 vertices, which is called a random Apollonian network. We prove that there exists a fixed δ<1, such that eventually every path in this graph has length less than t 𝛿, which verifies a conjecture of Cooper and Frieze (2015).

In this paper we study random Apollonian networks (RANs) and evolving Apollonian networks (EANs), in d dimensions for any d≥2, i.e. dynamically evolving random d-dimensional simplices, looked at as graphs inside an initial d-dimensional simplex. We determine the limiting degree distribution in RANs and show that it follows a power-law tail with exponent τ=(2d-1)/(d-1). We further show that the degree distribution in EANs converges to the same degree distribution if the simplex-occupation parameter in the nth step of the dynamics tends to 0 but is not summable in n. This result gives a rigorous proof for the conjecture of Zhang et al. (2006) that EANs tend to exhibit similar behaviour as RANs once the occupation parameter tends to 0. We also determine the asymptotic behaviour of the shortest paths in RANs and EANs for any d≥2. For RANs we show that the shortest path between two vertices chosen u.a.r. (typical distance), the flooding time of a vertex chosen uniformly at random, and the diameter of the graph after n steps all scale as a constant multiplied by log n. We determine the constants for all three cases and prove a central limit theorem for the typical distances. We prove a similar central limit theorem for typical distances in EANs.

Given any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean distance and by dE(u, v) their graph distance. The problem of finding upper bounds on dG(u, v) conditional on dE(u, v) that hold asymptotically almost surely has received quite a bit of attention in the literature. In this paper we improve the known upper bounds for values of r=ω(√logn) (that is, for r above the connectivity threshold). Our result also improves the best known estimates on the diameter of random geometric graphs. We also provide a lower bound on dE(u, v) conditional on dE(u, v).

We give sufficient conditions for a graph to be traceable and Hamiltonian in terms of the Wiener index and the complement of the graph, which correct and extend the result of Yang [‘Wiener index and traceable graphs’, Bull. Aust. Math. Soc.88 (2013), 380–383]. We also present sufficient conditions for a bipartite graph to be traceable and Hamiltonian in terms of its Wiener index and quasicomplement. Finally, we give sufficient conditions for a graph or a bipartite graph to be traceable and Hamiltonian in terms of its distance spectral radius.

We study the lower tail large deviation problem for subgraph counts in a random graph. Let XH denote the number of copies of H in an Erdős–Rényi random graph $\mathcal{G}(n,p)$. We are interested in estimating the lower tail probability $\mathbb{P}(X_H \le (1-\delta) \mathbb{E} X_H)$ for fixed 0 < δ < 1.

Thanks to the results of Chatterjee, Dembo and Varadhan, this large deviation problem has been reduced to a natural variational problem over graphons, at least for p ≥ n−αH (and conjecturally for a larger range of p). We study this variational problem and provide a partial characterization of the so-called ‘replica symmetric’ phase. Informally, our main result says that for every H, and 0 < δ < δH for some δH > 0, as p → 0 slowly, the main contribution to the lower tail probability comes from Erdős–Rényi random graphs with a uniformly tilted edge density. On the other hand, this is false for non-bipartite H and δ close to 1.

Judicious partitioning problems on graphs and hypergraphs ask for partitions that optimize several quantities simultaneously. Let k ≥ 2 be an integer and let G be a hypergraph with mi edges of size i for i=1,2. Bollobás and Scott conjectured that G has a partition into k classes, each of which contains at most $m_1/k+m_2/k^2+O(\sqrt{m_1+m_2})$ edges. In this paper, we confirm the conjecture affirmatively by showing that G has a partition into k classes, each of which contains at most

$$m_1/k+m_2/k^2+\ffrac{k-1}{2k^2}\sqrt{2(km_1+m_2)}+O(1)$$.

We consider the Widom–Rowlinson model of two types of interacting particles on d-regular graphs. We prove a tight upper bound on the occupancy fraction, the expected fraction of vertices occupied by a particle under a random configuration from the model. The upper bound is achieved uniquely by unions of complete graphs on d + 1 vertices, Kd+1. As a corollary we find that Kd+1 also maximizes the normalized partition function of the Widom–Rowlinson model over the class of d-regular graphs. A special case of this shows that the normalized number of homomorphisms from any d-regular graph G to the graph HWR, a path on three vertices with a loop on each vertex, is maximized by Kd+1. This proves a conjecture of Galvin.

Preferential attachment is a widely adopted paradigm for understanding the dynamics of social networks. Formal statistical inference, for instance GLM techniques, and model-verification methods will require knowing test statistics are asymptotically normal even though node- or count-based network data are nothing like classical data from independently replicated experiments. We therefore study asymptotic normality of degree counts for a sequence of growing simple undirected preferential attachment graphs. The methods of proof rely on identifying martingales and then exploiting the martingale central limit theorems.

Let $L$ be a countable language. We say that a countable infinite $L$ -structure ${\mathcal{M}}$ admits an invariant measure when there is a probability measure on the space of $L$ -structures with the same underlying set as ${\mathcal{M}}$ that is invariant under permutations of that set, and that assigns measure one to the isomorphism class of ${\mathcal{M}}$ . We show that ${\mathcal{M}}$ admits an invariant measure if and only if it has trivial definable closure, that is, the pointwise stabilizer in $\text{Aut}({\mathcal{M}})$ of an arbitrary finite tuple of ${\mathcal{M}}$ fixes no additional points. When ${\mathcal{M}}$ is a Fraïssé limit in a relational language, this amounts to requiring that the age of ${\mathcal{M}}$ have strong amalgamation. Our results give rise to new instances of structures that admit invariant measures and structures that do not.

We generalize Brooks’ theorem to show that if $G$ is a Borel graph on a standard Borel space $X$ of degree bounded by $d\geqslant 3$ which contains no $(d+1)$ -cliques, then $G$ admits a ${\it\mu}$ -measurable $d$ -coloring with respect to any Borel probability measure ${\it\mu}$ on $X$ , and a Baire measurable $d$ -coloring with respect to any compatible Polish topology on $X$ . The proof of this theorem uses a new technique for constructing one-ended spanning subforests of Borel graphs, as well as ideas from the study of list colorings. We apply the theorem to graphs arising from group actions to obtain factor of IID $d$ -colorings of Cayley graphs of degree $d$ , except in two exceptional cases.

Let Dk denote the tournament on 3k vertices consisting of three disjoint vertex classes V1, V2 and V3 of size k, each oriented as a transitive subtournament, and with edges directed from V1 to V2, from V2 to V3 and from V3 to V1. Fox and Sudakov proved that given a natural number k and ε > 0, there is n0(k, ε) such that every tournament of order n ⩾ n0(k,ε) which is ε-far from being transitive contains Dk as a subtournament. Their proof showed that $n_0(k,\epsilon ) \leq \epsilon ^{-O(k/\epsilon ^2)}$ and they conjectured that this could be reduced to n0(k, ε) ⩽ ε−O(k). Here we prove this conjecture.

It is proved that the median eigenvalues of every connected bipartite graph G of maximum degree at most three belong to the interval [−1, 1] with a single exception of the Heawood graph, whose median eigenvalues are $\pm\sqrt{2}$. Moreover, if G is not isomorphic to the Heawood graph, then a positive fraction of its median eigenvalues lie in the interval [−1, 1]. This surprising result has been motivated by the problem about HOMO-LUMO separation that arises in mathematical chemistry.

This paper investigates topological reconstruction, related to the reconstruction conjecture in graph theory. We ask whether the homeomorphism types of subspaces of a space X which are obtained by deleting singletons determine X uniquely up to homeomorphism. If the question can be answered affirmatively, such a space is called reconstructible. We prove that in various cases topological properties can be reconstructed. As main result we find that familiar spaces such as the reals ℝ, the rationals ℚ and the irrationals ℙ are reconstructible, as well as spaces occurring as Stone–Čech compactifications. Moreover, some non-reconstructible spaces are discovered, amongst them the Cantor set C.

In their recent paper Velleman and Warrington (2013) analyzed the expected values of some of the parameters in a memory game; namely, the length of the game, the waiting time for the first match, and the number of lucky moves. In this paper we continue this direction of investigation and obtain the limiting distributions of those parameters. More specifically, we prove that when suitably normalized, these quantities converge in distribution to a normal, Rayleigh, and Poisson random variable, respectively. We also make a connection between the memory game and one of the models of preferential attachment graphs. In particular, as a by-product of our methods, we obtain the joint asymptotic normality of the degree counts in the preferential attachment graphs. Furthermore, we obtain simpler proofs (although without rate of convergence) of some of the results of Peköz et al. (2014) on the joint limiting distributions of the degrees of the first few vertices in preferential attachment graphs. In order to prove that the length of the game is asymptotically normal, our main technical tool is a limit result for the joint distribution of the number of balls in a multitype generalized Pólya urn model.

We consider a directed graph on the integers with a directed edge from vertex i to j present with probability n-1, whenever i < j, independently of all other edges. Moreover, to each edge (i, j) we assign weight n-1(j - i). We show that the closure of vertex 0 in such a weighted random graph converges in distribution to the Poisson-weighted infinite tree as n → ∞. In addition, we derive limit theorems for the length of the longest path in the subgraph of the Poisson-weighted infinite tree which has all vertices at weighted distance of at most ρ from the root.