David J. Galvin

activity

20082023

most citedThree tutorial lectures on entropy and counting

32 citations · 91 across the 36 of their papers we have counts for

collaborators

Showing 2011Show all

4 papers · 1 filter

math.CO2011

The independent set sequence of regular bipartite graphs

David Galvin

Let $i_{t} (G)$ be the number of independent sets of size $t$ in a graph $G$ . Alavi, Erdős, Malde and Schwenk made the conjecture that if $G$ is a tree then the independent set sequen…

math.CO2011

Maximizing H-colorings of a regular graph

David Galvin

For graphs $G$ and $H$ , a {\em homomorphism} from $G$ to $H$ , or {\em $H$ -coloring} of $G$ , is an adjacency preserving map from the vertex set of $G$ to the vertex set of $H$ . Writ…

math.CO2011

H-coloring tori

John Engbers, David Galvin

For graphs $G$ and $H$ , an $H$ -coloring of $G$ is a function from the vertices of $G$ to the vertices of $H$ that preserves adjacency. $H$ -colorings encode graph theory notions suc…

math.CO2011★ 1 cited

H-colouring bipartite graphs

John Engbers, David Galvin

For graphs $G$ and $H$ , an {\em $H$ -colouring} of $G$ (or {\em homomorphism} from $G$ to $H$ ) is a function from the vertices of $G$ to the vertices of $H$ that preserves adjacency…