21 citations · 23 across the 3 of their papers we have counts for
3 papers
math.CO2017
Subhypergraphs in non-uniform random hypergraphs
Megan Dewar, John Healy, Xavier Pérez-Giménez +4
In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph proble…
math.CO2016★ 21 cited
Connectivity in Hypergraphs
Megan Dewar, David Pike, John Proos
In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by…
math.CO2016★ 2 cited
A note on Beckett-Gray codes and the relationship of Gray codes to data structures
Mark Cooke, Chris North, Megan Dewar +1
In this paper we introduce a natural mathematical structure derived from Samuel Beckett's play "Quad". We call this structure a binary Beckett-Gray code. We enumerate all codes for…