Michael Phillips

activity

20182021

most citedThe zero forcing polynomial of a graph

13 citations · 15 across the 5 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

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.CO2021★ 1 cited

Inducibility of 4-vertex tournaments

Dalton Burke, Bernard Lidický, Florian Pfender +1

We determine the inducibility of all tournaments with at most $4$ vertices together with the extremal constructions. The $4$ -vertex tournament containing an oriented $C_{3}$ and one…