Phillip Marmorino

activity

20212025

collaborators

3 papers

math.CO2025

Hoffman-London graphs: When paths minimize $H$ -colorings among trees

David Galvin, Phillip Marmorino, Emily McMillon +2

Given a graph $G$ and a target graph $H$ , an $H$ -coloring of $G$ is an adjacency-preserving vertex map from $G$ to $H$ . The number of $H$ -colorings of $G$ , $hom (G, H)$ , has been st…

math.CO2024

Counting independent sets in regular graphs with bounded independence number

David Galvin, Phillip Marmorino

An $n$ -vertex, $d$ -regular graph can have at most $2^{n /2 + o_{d} (n)}$ independent sets. In this paper we address what happens with this upper bound when we impose the further conditio…

math.DG2021

Genus three embedded doubly periodic minimal surfaces with parallel ends

Peter Connor, Shoichi Fujimori, Phillip Marmorino +1

We construct a one-parameter family of embedded doubly periodic minimal surfaces of genus three with four parallel ends. The Weierstrass data for each surface of the family are giv…

Hoffman-London graphs: When paths minimize H-colorings among trees

Counting independent sets in regular graphs with bounded independence number

Genus three embedded doubly periodic minimal surfaces with parallel ends

Hoffman-London graphs: When paths minimize $H$ -colorings among trees