7 papers
A new measure of robustness of Erdős--Ko--Rado Theorems on permutation groups
Karen Gunderson, Karen Meagher, Joy Morris +2
In this paper we introduce a new way of measuring the robustness of Erdős--Ko--Rado (EKR) Theorems on permutation groups. EKR-type results can be viewed as results about the indepe…
Inverse Fiedler vector problem of a graph
Jephian C. -H. Lin, Mahsa N Shirazi
Given a graph and one of its weighted Laplacian matrix, a Fiedler vector is an eigenvector with respect to the second smallest eigenvalue. The Fiedler vectors have been used widely…
Robustness of Erdős--Ko--Rado theorems on permutations and perfect matchings
Karen Gunderson, Karen Meagher, Joy Morris +2
The Erdős--Ko--Rado (EKR) theorem and its generalizations can be viewed as classifications of maximum independent sets in appropriately defined families of graphs, such as the Knes…
The -Analogue of Zero Forcing for Certain Families of Graphs
Shaun Fallat, Neha Joshi, Roghayeh Maleki +6
Zero forcing is a combinatorial game played on a graph with the ultimate goal of changing the colour of all the vertices at minimal cost. Originally this game was conceived as a on…
An extension of the Erdős-Ko-Rado theorem to set-wise -intersecting families of perfect matchings
Mahsa N. Shirazi
Two perfect matchings and of the complete graph on vertices are said to be set-wise -intersecting if there exist edges in and $Q_{1}, \cd…
An Extension of the Erdős-Ko-Rado Theorem to uniform set partitions
Karen Meagher, Mahsa N. Shirazi, Brett Stevens
A -partition is a set partition which has blocks each of size . Two uniform set partitions and are said to be partially -intersecting if there exist…