Alexander W. N. Riasanovsky

activity

20142021

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2021

Maximum spread of graphs and bipartite graphs

Jane Breen, Alex W. N. Riasanovsky, Michael Tait +1

Given any graph $G$ , the (adjacency) spread of $G$ is the maximum absolute difference between any two eigenvalues of the adjacency matrix of $G$ . In this paper, we resolve a pair o…

math.CO2020

On the edit distance function of the random graph

Ryan R. Martin, Alexander W. N. Riasanovsky

Given a hereditary property of graphs $H$ and a $p \in [0, 1]$ , the edit distance function $ed_{H} (p)$ is asymptotically the maximum proportion of edge-addi…

math.CO2016

Zarankiewicz Numbers and Bipartite Ramsey Numbers

Alex Collins, Alexander Riasanovsky, John Wallace +1

The Zarankiewicz number $z (b; s)$ is the maximum size of a subgraph of $K_{b, b}$ which does not contain $K_{s, s}$ as a subgraph. The two-color bipartite Ramsey number $b (s, t)$ is th…

math.CO2015

Chromatic Ramsey number of acyclic hypergraphs

András Gyárfás, Alexander W. N. Riasanovsky, Melissa U. Sherman-Bennett

Suppose that $T$ is an acyclic $r$ -uniform hypergraph, with $r \geq 2$ . We define the ( $t$ -color) chromatic Ramsey number $χ (T, t)$ as the smallest $m$ with the following property: if…