1 citations · 1 across the 8 of their papers we have counts for
10 papers
Zero Forcing on Iterated Graph Models
Christopher Brice, Erin Meger, Nhat-Dinh Nguyen +2
Modeling how information travels throughout a network has vast applications across social sciences, cybersecurity, and graph-based neural networks. In this paper, we consider the z…
A Path Variant of the Explorer Director Game on Graphs
Abigail Raz, Paddy Yang
The Explorer-Director game, first introduced by Nedev and Muthukrishnan (2008), simulates a Mobile Agent exploring a ring network with an inconsistent global sense of direction. Tw…
Note on the union-closed sets conjecture and Reimer's average set size theorem
Kengbo Lu, Abigail Raz
The Union-Closed Sets Conjecture, often attributed to Péter Frankl in 1979, remains an open problem in discrete mathematics. It posits that for any finite family of sets $S\neq\{\e…
The Iterative Independent Model
Erin Meger, Abigail Raz
Deterministic complex networks that use iterative generation algorithms have been found to more closely mirror properties found in real world networks than the traditional uniform…
The Explorer-Director Game on Graphs
Pat Devlin, Erin Meger, Abigail Raz +1
The Explorer-Director game, first introduced by Nedev and Muthukrishnan, can be described as a game where two players -- Explorer and Director -- determine the movement of a token…
Structure of the largest subgraphs of with a given matching number
Abigail Raz
This paper examines the structure of the largest subgraphs of the Erdős-Rényi random graph, , with a given matching number. This extends a result of Erdős and Gallai who,…