Michael J. Pelsmajer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Michael J. Pelsmajer has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Jeffrey A. Mudrock
Department of Mathematics and Statistics University of South Alabama Mobile Alabama USA
8 shared publications - Daniel Štefankovič
Computer Science Department University of Rochester 14627-0226 Rochester NY
6 shared publications - Hemanshu Kaul
Department of Applied Mathematics Illinois Institute of Technology Chicago Illinois USA
6 shared publications - Marcus Schaefer
DePaul University
6 shared publications - Radoslav Fulek
University of Arizona, Tucson, USA
4 shared publications - André Kündgen
California State University San Marcos
2 shared publications
Latest Publications
- Open Access
Flexible list colorings: Maximizing the number of requests satisfied
Flexible list coloring was introduced by Dvo\v{r}\'{a}k, Norin, and Postle in 2019. Suppose $0 \leq \epsilon \leq 1$, $G$ is a graph, $L$ is a list assignment for $G$, and $r$ is a function with non-empty domain $D\subseteq V(G)$ such that $r(v) \in L(v)$ for each $v \in D$ ($r$ is called a request of $L$). The triple $(G,L,r)$ is $\epsilon$-satisfiable if there exists a proper $L$-coloring $f$ of $G$ such that $f(v) = r(v)$ for at least $\epsilon|D|$ vertices in $D$. We say $G$ is $(k, \epsilon)$-flexible if $(G,L',r')$ is $\epsilon$-satisfiable whenever $L'$ is a $k$-assignment for $G$ and $r'$ is a request of $L'$. It was shown by Dvo\v{r}\'{a}k et al. that if $d+1$ is prime, $G$ is a $d$-degenerate graph, and $r$ is a request for $G$ with domain of size $1$, then $(G,L,r)$ is $1$-satisfiable whenever $L$ is a $(d+1)$-assignment. In this paper, we extend this result to all $d$ for bipartite $d$-degenerate graphs. The literature on flexible list coloring tends to focus on showing that for a fixed graph $G$ and $k \in \mathbb{N}$ there exists an $\epsilon > 0$ such that $G$ is $(k, \epsilon)$-flexible, but it is natural to try to find the largest possible $\epsilon$ for which $G$ is $(k,\epsilon)$-flexible. In this vein, we improve a result of Dvo\v{r}\'{a}k et al., by showing $d$-degenerate graphs are $(d+2, 1/2^{d+1})$-flexible. In pursuit of the largest $\epsilon$ for which a graph is $(k,\epsilon)$-flexible, we observe that a graph $G$ is not $(k, \epsilon)$-flexible for any $k$ if and only if $\epsilon > 1/ \rho(G)$, where $\rho(G)$ is the Hall ratio of $G$, and we initiate the study of the list flexibility number of a graph $G$, which is the smallest $k$ such that $G$ is $(k,1/ \rho(G))$-flexible. We study relationships and connections between the list flexibility number, list chromatic number, list packing number, and degeneracy of a graph.Open AccessFlexible list colorings: Maximizing the number of requests satisfied
Flexible list coloring was introduced by Dvo\v{r}\'{a}k, Norin, and Postle in 2019. Suppose $0 \leq \epsilon \leq 1$, $G$ is a graph, $L$ is a list assignment for $G$, and $r$ is a function with non-empty domain $D\subseteq V(G)$ such that $r(v) \in L(v)$ for each $v \in D$ ($r$ is called a request of $L$). The triple $(G,L,r)$ is $\epsilon$-satisfiable if there exists a proper $L$-coloring $f$ of $G$ such that $f(v) = r(v)$ for at least $\epsilon|D|$ vertices in $D$. We say $G$ is $(k, \epsilon)$-flexible if $(G,L',r')$ is $\epsilon$-satisfiable whenever $L'$ is a $k$-assignment for $G$ and $r'$ is a request of $L'$. It was shown by Dvo\v{r}\'{a}k et al. that if $d+1$ is prime, $G$ is a $d$-degenerate graph, and $r$ is a request for $G$ with domain of size $1$, then $(G,L,r)$ is $1$-satisfiable whenever $L$ is a $(d+1)$-assignment. In this paper, we extend this result to all $d$ for bipartite $d$-degenerate graphs. The literature on flexible list coloring tends to focus on showing that for a fixed graph $G$ and $k \in \mathbb{N}$ there exists an $\epsilon > 0$ such that $G$ is $(k, \epsilon)$-flexible, but it is natural to try to find the largest possible $\epsilon$ for which $G$ is $(k,\epsilon)$-flexible. In this vein, we improve a result of Dvo\v{r}\'{a}k et al., by showing $d$-degenerate graphs are $(d+2, 1/2^{d+1})$-flexible. In pursuit of the largest $\epsilon$ for which a graph is $(k,\epsilon)$-flexible, we observe that a graph $G$ is not $(k, \epsilon)$-flexible for any $k$ if and only if $\epsilon > 1/ \rho(G)$, where $\rho(G)$ is the Hall ratio of $G$, and we initiate the study of the list flexibility number of a graph $G$, which is the smallest $k$ such that $G$ is $(k,1/ \rho(G))$-flexible. We study relationships and connections between the list flexibility number, list chromatic number, list packing number, and degeneracy of a graph. - Open Access
- 13 January 2023
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 30 (1) , P1.14
Hanani-Tutte for Radial Planarity II
A drawing of a graph $G$, possibly with multiple edges but without loops, is radial if all edges are drawn radially, that is, each edge intersects every circle centered at the origin at most once. $G$ is radial planar if it has a radial embedding, that is, a crossing-free radial drawing. If the vertices of $G$ are ordered or partitioned into ordered levels (as they are for leveled graphs), we require that the distances of the vertices from the origin respect the ordering or leveling. A pair of edges $e$ and $f$ in a graph is independent if $e$ and $f$ do not share a vertex. We show that if a leveled graph $G$ has a radial drawing in which every two independent edges cross an even number of times, then $G$ is radial planar. In other words, we establish the strong Hanani-Tutte theorem for radial planarity. This characterization yields a very simple algorithm for radial planarity testing.- 13 January 2023
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 30 (1) , P1.14
Open AccessHanani-Tutte for Radial Planarity II
A drawing of a graph $G$, possibly with multiple edges but without loops, is radial if all edges are drawn radially, that is, each edge intersects every circle centered at the origin at most once. $G$ is radial planar if it has a radial embedding, that is, a crossing-free radial drawing. If the vertices of $G$ are ordered or partitioned into ordered levels (as they are for leveled graphs), we require that the distances of the vertices from the origin respect the ordering or leveling. A pair of edges $e$ and $f$ in a graph is independent if $e$ and $f$ do not share a vertex. We show that if a leveled graph $G$ has a radial drawing in which every two independent edges cross an even number of times, then $G$ is radial planar. In other words, we establish the strong Hanani-Tutte theorem for radial planarity. This characterization yields a very simple algorithm for radial planarity testing. - Open Access
- 27 October 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (21) , 2726
Space: The Re-Visioning Frontier of Biological Image Analysis with Graph Theory, Computational Geometry, and Spatial Statistics
Every biological image contains quantitative data that can be used to test hypotheses about how patterns were formed, what entities are associated with one another, and whether standard mathematical methods inform our understanding of biological phenomena. In particular, spatial point distributions and polygonal tessellations are particularly amendable to analysis with a variety of graph theoretic, computational geometric, and spatial statistical tools such as: Voronoi polygons; Delaunay triangulations; perpendicular bisectors; circumcenters; convex hulls; minimal spanning trees; Ulam trees; Pitteway violations; circularity; Clark-Evans spatial statistics; variance to mean ratios; Gabriel graphs; and, minimal spanning trees. Furthermore, biologists have developed a number of empirically related correlations for polygonal tessellations such as: Lewis’s law (the number of edges of convex polygons are positively correlated with the areas of these polygons): Desch’s Law (the number of edges of convex polygons are positively correlated with the perimeters of these polygons); and Errara’s Law (daughter cell areas should be roughly half that of their parent cells’ areas). We introduce a new Pitteway Law that the number of sides of the convex polygons in a Voronoi tessellation of biological epithelia is proportional to the minimal interior angle of the convex polygons as angles less than 90 degrees result in Pitteway violations of the Delaunay dual of the Voronoi tessellation.
- 27 October 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (21) , 2726
Open AccessSpace: The Re-Visioning Frontier of Biological Image Analysis with Graph Theory, Computational Geometry, and Spatial Statistics
Every biological image contains quantitative data that can be used to test hypotheses about how patterns were formed, what entities are associated with one another, and whether standard mathematical methods inform our understanding of biological phenomena. In particular, spatial point distributions and polygonal tessellations are particularly amendable to analysis with a variety of graph theoretic, computational geometric, and spatial statistical tools such as: Voronoi polygons; Delaunay triangulations; perpendicular bisectors; circumcenters; convex hulls; minimal spanning trees; Ulam trees; Pitteway violations; circularity; Clark-Evans spatial statistics; variance to mean ratios; Gabriel graphs; and, minimal spanning trees. Furthermore, biologists have developed a number of empirically related correlations for polygonal tessellations such as: Lewis’s law (the number of edges of convex polygons are positively correlated with the areas of these polygons): Desch’s Law (the number of edges of convex polygons are positively correlated with the perimeters of these polygons); and Errara’s Law (daughter cell areas should be roughly half that of their parent cells’ areas). We introduce a new Pitteway Law that the number of sides of the convex polygons in a Voronoi tessellation of biological epithelia is proportional to the minimal interior angle of the convex polygons as angles less than 90 degrees result in Pitteway violations of the Delaunay dual of the Voronoi tessellation.
- Open Access
- 31 August 2021
- Published by MDPI AG in Preprints.org
Space: The Re-visioning Frontier of Biological Image Analysis with Graph Theory, Computational Geometry, and Spatial Statistics
Every biological image contains quantitative data that can be used to test hypotheses about how patterns were formed, what entities are associated with one another, and whether standard mathematical methods inform our understanding of biological phenomena. In particular, spatial point distributions and polygonal tessellations are particularly amendable to analysis with a variety of graph theoretic, computational geometric, and spatial statistical tools such as: Voronoi Polygons; Delaunay Triangulations; Perpendicular Bisectors; Circumcenters; Convex Hulls; Minimal Spanning Trees; Ulam Trees; Pitteway Violations; Circularity; Clark-Evans spatial statistics; Variance to Mean Ratios; Gabriel Graphs; and, Minimal Spanning Trees. Furthermore, biologists have developed a number of empirically related correlations for polygonal tessellations such as: Lewis’s Law (the number of edges of convex polygons are positively correlated with the areas of these polygons): Desch’s Law (the number of edges of convex polygons are positively correlated with the perimeters of these polygons); and Errara’s Law (daughter cell areas should be roughly half that of their parent cells’ areas). We introduce a new Pitteway Law that the number of sides of the convex polygons in a Voronoi tessellation of biological epithelia is proportional to the minimal interior angle of the convex polygons as angles less than 90 degrees result in Pitteway violations of the Delaunay dual of the Voronoi tessellation.
- 31 August 2021
- Published by MDPI AG in Preprints.org
Open AccessSpace: The Re-visioning Frontier of Biological Image Analysis with Graph Theory, Computational Geometry, and Spatial Statistics
Every biological image contains quantitative data that can be used to test hypotheses about how patterns were formed, what entities are associated with one another, and whether standard mathematical methods inform our understanding of biological phenomena. In particular, spatial point distributions and polygonal tessellations are particularly amendable to analysis with a variety of graph theoretic, computational geometric, and spatial statistical tools such as: Voronoi Polygons; Delaunay Triangulations; Perpendicular Bisectors; Circumcenters; Convex Hulls; Minimal Spanning Trees; Ulam Trees; Pitteway Violations; Circularity; Clark-Evans spatial statistics; Variance to Mean Ratios; Gabriel Graphs; and, Minimal Spanning Trees. Furthermore, biologists have developed a number of empirically related correlations for polygonal tessellations such as: Lewis’s Law (the number of edges of convex polygons are positively correlated with the areas of these polygons): Desch’s Law (the number of edges of convex polygons are positively correlated with the perimeters of these polygons); and Errara’s Law (daughter cell areas should be roughly half that of their parent cells’ areas). We introduce a new Pitteway Law that the number of sides of the convex polygons in a Voronoi tessellation of biological epithelia is proportional to the minimal interior angle of the convex polygons as angles less than 90 degrees result in Pitteway violations of the Delaunay dual of the Voronoi tessellation.
- Open Access
On Equitable List Arboricity of Graphs
Equitable list arboricity, introduced by Zhang in 2016, generalizes the notion of equitable list coloring by requiring the subgraph induced by each color class to be acyclic (instead of edgeless) in addition to the usual upper bound on the size of each color class. Graph $G$ is equitably $k$-list arborable if an equitable, arborable list coloring of $G$ exists for every list assignment for $G$ that associates with each vertex in $G$ a list of $k$ available colors. Zhang conjectured that any graph $G$ is equitably $k$-list arborable for each $k$ satisfying $k \geq \lceil (1+\Delta(G))/2 \rceil$. We verify this conjecture for powers of cycles by applying a new lemma which is a general tool for extending partial equitable, arborable list colorings. We also propose a stronger version of Zhang's Conjecture for certain connected graphs: any connected graph $G$ is equitably $k$-list arborable for each $k$ satisfying $k \geq \lceil \Delta(G)/2 \rceil$ provided $G$ is neither a cycle nor a complete graph of odd order. We verify this stronger version of Zhang's Conjecture for powers of paths, 2-degenerate graphs, and certain other graphs. We also show that if $G$ is equitably $k$-list arborable it does not necessarily follow that $G$ is equitably $(k+1)$-list arborable which addresses a question of Drgas-Burchardt, Furmanczyk, and Sidorowicz (2018).Open AccessOn Equitable List Arboricity of Graphs
Equitable list arboricity, introduced by Zhang in 2016, generalizes the notion of equitable list coloring by requiring the subgraph induced by each color class to be acyclic (instead of edgeless) in addition to the usual upper bound on the size of each color class. Graph $G$ is equitably $k$-list arborable if an equitable, arborable list coloring of $G$ exists for every list assignment for $G$ that associates with each vertex in $G$ a list of $k$ available colors. Zhang conjectured that any graph $G$ is equitably $k$-list arborable for each $k$ satisfying $k \geq \lceil (1+\Delta(G))/2 \rceil$. We verify this conjecture for powers of cycles by applying a new lemma which is a general tool for extending partial equitable, arborable list colorings. We also propose a stronger version of Zhang's Conjecture for certain connected graphs: any connected graph $G$ is equitably $k$-list arborable for each $k$ satisfying $k \geq \lceil \Delta(G)/2 \rceil$ provided $G$ is neither a cycle nor a complete graph of odd order. We verify this stronger version of Zhang's Conjecture for powers of paths, 2-degenerate graphs, and certain other graphs. We also show that if $G$ is equitably $k$-list arborable it does not necessarily follow that $G$ is equitably $(k+1)$-list arborable which addresses a question of Drgas-Burchardt, Furmanczyk, and Sidorowicz (2018). - Open Access
Strong Hanani-Tutte for the Torus
If a graph can be drawn on the torus so that every two independent edges cross an even number of times, then the graph can be embedded on the torus.
Open AccessStrong Hanani-Tutte for the Torus
If a graph can be drawn on the torus so that every two independent edges cross an even number of times, then the graph can be embedded on the torus.
- 25 January 2021
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (4) , 112306
Partial DP-coloring of graphs
- 25 January 2021
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (4) , 112306
Partial DP-coloring of graphs
- Open Access
Partial DP-Coloring
In 1980, Albertson and Berman introduced partial coloring. In 2000, Albertson, Grossman, and Haas introduced partial list coloring. Here, we initiate the study of partial coloring for an insightful generalization of list coloring introduced in 2015 by Dvo\v{r}\'{a}k and Postle, DP-coloring (or correspondence coloring). We consider the DP-coloring analogue of the Partial List Coloring Conjecture, which generalizes a natural bound for partial coloring. We show that while this partial DP-coloring conjecture does not hold, several results on partial list coloring can be extended to partial DP-coloring. We also study partial DP-coloring of the join of a graph with a complete graph, and we present several interesting open questions.
Open AccessPartial DP-Coloring
In 1980, Albertson and Berman introduced partial coloring. In 2000, Albertson, Grossman, and Haas introduced partial list coloring. Here, we initiate the study of partial coloring for an insightful generalization of list coloring introduced in 2015 by Dvo\v{r}\'{a}k and Postle, DP-coloring (or correspondence coloring). We consider the DP-coloring analogue of the Partial List Coloring Conjecture, which generalizes a natural bound for partial coloring. We show that while this partial DP-coloring conjecture does not hold, several results on partial list coloring can be extended to partial DP-coloring. We also study partial DP-coloring of the join of a graph with a complete graph, and we present several interesting open questions.
- 15 February 2020
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 36 (3) , 679-687
A Simple Characterization of Proportionally 2-choosable Graphs
- 15 February 2020
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 36 (3) , 679-687
A Simple Characterization of Proportionally 2-choosable Graphs
- 24 October 2018
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 34 (6) , 1637-1649
Total Equitable List Coloring
- 24 October 2018
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 34 (6) , 1637-1649
Total Equitable List Coloring