P. Balister

collaborators

3 papers

math.CO2026

Upper bounds for multicolour Ramsey numbers

Paul Balister, BÃ©la BollobÃ¡s, Marcelo Campos +5

The $r$ -colour Ramsey number $R_{r} (k)$ is the minimum $n \in N$ such that every $r$ -colouring of the edges of the complete graph $K_{n}$ on $n$ vertices contains a monochroma…

math.PR2025

Improved bounds for 1-independent percolation on $Z^{n}$

Paul Balister, Tom Johnston, Michael Savery +1

A 1-independent bond percolation model on a graph $G$ is a probability distribution on the spanning subgraphs of $G$ in which, for all vertex-disjoint sets of edges $S_{1}$ and $S_{2}$ …

math.CO2025

A local limit theorem for the edge counts of random induced subgraphs of a random graph

Paul Balister, Emil Powierski, Alex Scott +1

Consider a `dense' ErdÅs--RÃ©nyi random graph model $G = G_{n, M}$ with $n$ vertices and $M$ edges, where we assume the edge density $M / (2 n)$ is bounded away from 0 and 1. Fi…

Upper bounds for multicolour Ramsey numbers

Improved bounds for 1-independent percolation on Zn

A local limit theorem for the edge counts of random induced subgraphs of a random graph

Improved bounds for 1-independent percolation on $Z^{n}$