The bandwidth theorem of Böttcher, Schacht and Taraz states that any n-vertex graph G with minimum degree $\big(\tfrac{k-1}{k}+o(1)\big)n$ contains all n-vertex k-colourable graphs H with bounded maximum degree and bandwidth o(n). Recently, a subset of the authors proved a random graph analogue of this statement: for $p\gg \big(\tfrac{\log n}{n}\big)^{1/\Delta}$ a.a.s. each spanning subgraph G of G(n,p) with minimum degree $\big(\tfrac{k-1}{k}+o(1)\big)pn$ contains all n-vertex k-colourable graphs H with maximum degree $\Delta$, bandwidth o(n), and at least $C p^{-2}$ vertices not contained in any triangle. This restriction on vertices in triangles is necessary, but limiting. In this paper, we consider how it can be avoided. A special case of our main result is that, under the same conditions, if additionally all vertex neighbourhoods in G contain many copies of $K_\Delta$ then we can drop the restriction on H that $Cp^{-2}$ vertices should not be in triangles.

Let $p_{\{3, 3\}}(n)$ denote the number of $3$-regular partitions in three colours. Da Silva and Sellers [‘Arithmetic properties of 3-regular partitions in three colours’, Bull. Aust. Math. Soc. 104(3) (2021), 415–423] conjectured four Ramanujan-like congruences modulo $5$ satisfied by $p_{\{3, 3\}}(n)$. We confirm these conjectural congruences using the theory of modular forms.

We study the free metabelian group $M(2,n)$ of prime power exponent n on two generators by means of invariants $M(2,n)'\to \mathbb {Z}_n$ that we construct from colorings of the squares in the integer grid $\mathbb {R} \times \mathbb {Z} \cup \mathbb {Z} \times \mathbb {R}$. In particular, we improve bounds found by Newman for the order of $M(2,2^k)$. We study identities in $M(2,n)$, which give information about identities in the Burnside group $B(2,n)$ and the restricted Burnside group $R(2,n)$.

Let G be a simple complex algebraic group, and let $K \subset G$ be a reductive subgroup such that the coordinate ring of $G/K$ is a multiplicity-free G-module. We consider the G-algebra structure of $\mathbb C[G/K]$ and study the decomposition into irreducible summands of the product of irreducible G-submodules in $\mathbb C[G/K]$. When the spherical roots of $G/K$ generate a root system of type $\mathsf A$, we propose a conjectural decomposition rule, which relies on a conjecture of Stanley on the multiplication of Jack symmetric functions. With the exception of one case, we show that the rule holds true whenever the root system generated by the spherical roots of $G/K$ is a direct sum of subsystems of rank 1.

We study the number of ways of factoring elements in the complex reflection groups$G(r,s,n)$ as products of reflections. We prove a result that compares factorization numbers in$G(r,s,n)$ to those in the symmetric group$S_n$, and we use this comparison, along with the Ekedahl, Lando, Shapiro, and Vainshtein (ELSV) formula, to deduce a polynomial structure for factorizations in$G(r,s,n)$.

We interpret the degrees which arise in Tevelev’s study of scattering amplitudes in terms of moduli spaces of Hurwitz covers. Via excess intersection theory, the boundary geometry of the Hurwitz moduli space yields a simple recursion for the Tevelev degrees (together with their natural two parameter generalisation). We find exact solutions which specialise to Tevelev’s formula in his cases and connect to the projective geometry of lines and Castelnuovo’s classical count of $g^1_d$’s in other cases. For almost all values, the calculation of the two parameter generalisation of the Tevelev degree is new. A related count of refined Dyck paths is solved along the way.

A graph G is called a $(P_{\geq n},k)$-factor-critical covered graph if for any $Q\subseteq V(G)$ with $|Q|=k$ and any $e\in E(G-Q)$, $G-Q$ has a $P_{\geq n}$-factor covering e. We demonstrate that (i) a $(k+1)$-connected graph G with at least $k+3$ vertices is a $(P_{\geq 3},k)$-factor-critical covered graph if its toughness $t(G)>{(2+k)}/{3}$; (ii) a $(k+2)$-connected graph G is a $(P_{\geq 3},k)$-factor-critical covered graph if its isolated toughness $I(G)>{(5+k)}/{3}$. Furthermore, we show that the conditions on $t(G)$ and $I(G)$ are sharp.

Hajnal and Szemerédi proved that if G is a finite graph with maximum degree $\Delta $, then for every integer $k \geq \Delta +1$, G has a proper colouring with k colours in which every two colour classes differ in size at most by $1$; such colourings are called equitable. We obtain an analogue of this result for infinite graphs in the Borel setting. Specifically, we show that if G is an aperiodic Borel graph of finite maximum degree $\Delta $, then for each $k \geq \Delta + 1$, G has a Borel proper k-colouring in which every two colour classes are related by an element of the Borel full semigroup of G. In particular, such colourings are equitable with respect to every G-invariant probability measure. We also establish a measurable version of a result of Kostochka and Nakprasit on equitable $\Delta $-colourings of graphs with small average degree. Namely, we prove that if $\Delta \geq 3$, G does not contain a clique on $\Delta + 1$ vertices and $\mu $ is an atomless G-invariant probability measure such that the average degree of G with respect to $\mu $ is at most $\Delta /5$, then G has a $\mu $-equitable $\Delta $-colouring. As steps toward the proof of this result, we establish measurable and list-colouring extensions of a strengthening of Brooks’ theorem due to Kostochka and Nakprasit.

We study a natural model of a random $2$-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result exhibits a sharp threshold $p=1/2$ for homology vanishing as $n \to \infty $. This is a $2$-dimensional analogue of the Burtin and Erdoős–Spencer theorems characterising the connectivity threshold for random graphs on the $1$-skeleton of the n-dimensional cube.

Our main result can also be seen as a cubical counterpart to the Linial–Meshulam theorem for random $2$-dimensional simplicial complexes. However, the models exhibit strikingly different behaviours. We show that if $p> 1 - \sqrt {1/2} \approx 0.2929$, then with high probability the fundamental group is a free group with one generator for every maximal $1$-dimensional face. As a corollary, homology vanishing and simple connectivity have the same threshold, even in the strong ‘hitting time’ sense. This is in contrast with the simplicial case, where the thresholds are far apart. The proof depends on an iterative algorithm for contracting cycles – we show that with high probability, the algorithm rapidly and dramatically simplifies the fundamental group, converging after only a few steps.

A classical theorem of Frucht states that any finite group appears as the automorphism group of a finite graph. In the quantum setting, the problem is to understand the structure of the compact quantum groups which can appear as quantum automorphism groups of finite graphs. We discuss here this question, notably with a number of negative results.

Let $\mathrm{AP}_k=\{a,a+d,\ldots,a+(k-1)d\}$ be an arithmetic progression. For $\varepsilon>0$ we call a set $\mathrm{AP}_k(\varepsilon)=\{x_0,\ldots,x_{k-1}\}$ an $\varepsilon$-approximate arithmetic progression if for some a and d, $|x_i-(a+id)|<\varepsilon d$ holds for all $i\in\{0,1\ldots,k-1\}$. Complementing earlier results of Dumitrescu (2011, J. Comput. Geom. 2(1) 16–29), in this paper we study numerical aspects of Van der Waerden, Szemerédi and Furstenberg–Katznelson like results in which arithmetic progressions and their higher dimensional extensions are replaced by their $\varepsilon$-approximation.

Random intersection graphs model networks with communities, assuming an underlying bipartite structure of communities and individuals, where these communities may overlap. We generalize the model, allowing for arbitrary community structures within the communities. In our new model, communities may overlap, and they have their own internal structure described by arbitrary finite community graphs. Our model turns out to be tractable. We analyze the overlapping structure of the communities, show local weak convergence (including convergence of subgraph counts), and derive the asymptotic degree distribution and the local clustering coefficient.

In the localization game on a graph, the goal is to find a fixed but unknown target node $v^\star$ with the least number of distance queries possible. In the jth step of the game, the player queries a single node $v_j$ and receives, as an answer to their query, the distance between the nodes $v_j$ and $v^\star$. The sequential metric dimension (SMD) is the minimal number of queries that the player needs to guess the target with absolute certainty, no matter where the target is.

The term SMD originates from the related notion of metric dimension (MD), which can be defined the same way as the SMD except that the player’s queries are non-adaptive. In this work we extend the results of Bollobás, Mitsche, and Prałat [4] on the MD of Erdős–Rényi graphs to the SMD. We find that, in connected Erdős–Rényi graphs, the MD and the SMD are a constant factor apart. For the lower bound we present a clean analysis by combining tools developed for the MD and a novel coupling argument. For the upper bound we show that a strategy that greedily minimizes the number of candidate targets in each step uses asymptotically optimal queries in Erdős–Rényi graphs. Connections with source localization, binary search on graphs, and the birthday problem are discussed.

A classical result for the simple symmetric random walk with 2n steps is that the number of steps above the origin, the time of the last visit to the origin, and the time of the maximum height all have exactly the same distribution and converge when scaled to the arcsine law. Motivated by applications in genomics, we study the distributions of these statistics for the non-Markovian random walk generated from the ascents and descents of a uniform random permutation and a Mallows(q) permutation and show that they have the same asymptotic distributions as for the simple random walk. We also give an unexpected conjecture, along with numerical evidence and a partial proof in special cases, for the result that the number of steps above the origin by step 2n for the uniform permutation generated walk has exactly the same discrete arcsine distribution as for the simple random walk, even though the other statistics for these walks have very different laws. We also give explicit error bounds to the limit theorems using Stein’s method for the arcsine distribution, as well as functional central limit theorems and a strong embedding of the Mallows(q) permutation which is of independent interest.

We investigate spatial random graphs defined on the points of a Poisson process in d-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point is assigned an independent weight. Given the weight and position of the points, we form an edge between any pair of points independently with a probability depending on the two weights of the points and their distance. Preference is given to short edges and connections to vertices with large weights. We characterize the parameter regime where there is a non-trivial percolation phase transition and show that it depends not only on the power-law exponent of the degree distribution but also on a geometric model parameter. We apply this result to characterize robustness of age-based spatial preferential attachment networks.

Consider a homogeneous Poisson point process of the Euclidean plane and its Voronoi tessellation. The present note discusses the properties of two stationary point processes associated with the latter and depending on a parameter $\theta$. The first is the set of points that belong to some one-dimensional facet of the Voronoi tessellation and such that the angle with which they see the two nuclei defining the facet is $\theta$. The main question of interest on this first point process is its intensity. The second point process is that of the intersections of the said tessellation with a straight line having a random orientation. Its intensity is well known. The intersection points almost surely belong to one-dimensional facets. The main question here concerns the Palm distribution of the angle with which the points of this second point process see the two nuclei associated with the facet. We will give answers to these two questions and briefly discuss their practical motivations. We also discuss natural extensions to three dimensions.

Motivated by applications to a wide range of areas, including assemble-to-order systems, operations scheduling, healthcare systems, and the collaborative economy, we study a stochastic matching model on hypergraphs, extending the model of Mairesse and Moyal (J. Appl. Prob. 53, 2016) to the case of hypergraphical (rather than graphical) matching structures. We address a discrete-event system under a random input of single items, simply using the system as an interface to be matched in groups of two or more. We primarily study the stability of this model, for various hypergraph geometries.

We prove concentration inequality results for geometric graph properties of an instance of the Cooper–Frieze [5] preferential attachment model with edge-steps. More precisely, we investigate a random graph model that at each time $t\in \mathbb{N}$, with probability p adds a new vertex to the graph (a vertex-step occurs) or with probability $1-p$ an edge connecting two existent vertices is added (an edge-step occurs). We prove concentration results for the global clustering coefficient as well as the clique number. More formally, we prove that the global clustering, with high probability, decays as $t^{-\gamma(p)}$ for a positive function $\gamma$ of p, whereas the clique number of these graphs is, up to subpolynomially small factors, of order $t^{(1-p)/(2-p)}$.

Let R be a commutative ring with identity which is not an integral domain. An ideal I of R is called an annihilating ideal if there exists $r\in R- \{0\}$ such that $Ir=(0)$. The total graph of nonzero annihilating ideals of R is the graph $\Omega (R)$ whose vertices are the nonzero annihilating ideals of R and two distinct vertices $I,J$ are joined if and only if $I+J$ is also an annihilating ideal of R. We study the strong metric dimension of $\Omega (R)$ and evaluate it in several cases.