6 citations · 10 across the 6 of their papers we have counts for
6 papers
A Generalization of the Methods of Brass, Harboth, and Nieborg
Brendon Stanton
In 1995, Brass, Harborth and Nienborg disproved a conjecture of Erdős when they showed that a -free subgraph of the hypercube, , can have at least $(\frac 12 +ω(1))e(Q_n)…
On a covering problem in the hypercube
Brendon Stanton, Lale Özkahya
In this paper, we address a particular variation of the Turán problem for the hypercube. Alon, Krech and Szabó (2007) asked "In an n-dimensional hypercube, Qn, and for l < d < n, w…
On Vertex Identifying Codes For Infinite Lattices
Brendon Stanton
PhD Thesis--A compilation of the papers: "Lower Bounds for Identifying Codes in Some Infinite Grids", "Improved Bounds for r-identifying Codes of the Hex Grid", and "Vertex Identif…
Vertex identifying codes for the n-dimensional lattice
Brendon Stanton
An -identifying code on a graph is a set such that for every vertex in , the intersection of the radius- closed neighborhood with is nonempty an…
Lower bounds for identifying codes in some infinite grids
Ryan Martin, Brendon Stanton
An -identifying code on a graph is a set such that for every vertex in , the intersection of the radius- closed neighborhood with is nonempty an…
Improved Bounds for -Identifying Codes of the Hex Grid
Brendon Stanton
For any positive integer , an -identifying code on a graph is a set such that for every vertex in , the intersection of the radius- closed neighb…