6 papers
Piercing families of convex sets in the plane that avoid a certain subfamily with lines
Daniel McGinnis
We define a to be a family of sets such that when $\{i,i+1\}\cap \{j,j+1\}=…
Line transversals in families of connected sets the plane
Daniel McGinnis, Shira Zerbib
We prove that if a family of compact connected sets in the plane has the property that every three members of it are intersected by a line, then there are three lines intersecting…
A family of convex sets in the plane satisfying the -property can be pierced by nine points
Daniel McGinnis
We prove that every finite family of convex sets in the plane satisfying the -property can be pierced by points. This improves the bound of proved by Gyárfás, Kleit…
A Method to Construct -Rotational Factorizations of Complete Graphs and Solutions to the Oberwolfach Problem
Daniel McGinnis, Eirini Poimenidou
The concept of a -rotational factorization of a complete graph under a finite group was studied in detail by Buratti and Rinaldi. They found that if admits a -rotatio…
On the Domination Number of Permutation Graphs and an Application to Strong Fixed Points
Theresa Baren, Michael Cory, Mia Friedberg +6
A permutation graph is a simple graph with vertices corresponding to the elements of and an edge between and when and are inverted in . A set of vertic…
Extremal Problems Related to the Cardinality Redundance of Graphs
Daniel McGinnis, Nathan Shank
A dominating set of a graph is a set of vertices such that for all , either or for some . The cardinality redundance of a ve…