Michael Phillips

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2021

Low Diameter Monochromatic Covers of Complete Multipartite Graphs

Sean English, Connor Mattes, Grace McCourt +1

Let the diameter cover number, $D_{r}^{t} (G)$ , denote the least integer $d$ such that under any $r$ -coloring of the edges of the graph $G$ , there exists a collection of $t$ monochromat…

math.CO2021★ 1 cited

Inducibility of the Net Graph

Adam Blumenthal, Michael Phillips

A graph $F$ is called a fractalizer if for all $n$ the only graphs which maximize the number of induced copies of $F$ on $n$ vertices are the balanced iterated blow ups of $F$ . Whi…

math.CO2020

Hadamard diagonalizable graphs of order at most 36

Jane Breen, Steve Butler, Melissa Fuentes +7

If the Laplacian matrix of a graph has a full set of orthogonal eigenvectors with entries $\pm 1$ , then the matrix formed by taking the columns as the eigenvectors is a Hadamard mat…