Search Results - "Luther, Robert D"

Existential Closure in Line Graphs by Burgess, Andrea C., Luther, Robert D., Pike, David A.

“…A graph is n - existentially closed if, for all disjoint sets of vertices A and B with | A ∪ B | = n , there is a vertex z not in A ∪ B adjacent to each vertex…”
Get full text

The edge‐connectivity of vertex‐transitive hypergraphs by Burgess, Andrea C., Luther, Robert D., Pike, David A.

“…A graph or hypergraph is said to be vertex‐transitive if its automorphism group acts transitively upon its vertices. A classic theorem of Mader asserts that…”
Get full text

Equitably Colored Balanced Incomplete Block Designs by Luther, Robert D., Pike, David A.

“…In this paper, we determine the necessary and sufficient conditions for the existence of an equitably ℓ‐colorable balanced incomplete block design for any…”
Get full text

Existential Closure in Uniform Hypergraphs by Burgess, Andrea C, Luther, Robert D, Pike, David A

“…For a positive integer $n$, a graph with at least $n$ vertices is $n$-existentially closed or simply $n$-e.c. if for any set of vertices $S$ of size $n$ and…”
Get full text

Existential Closure in Line Graphs by Burgess, Andrea C, Luther, Robert D, Pike, David A

“…A graph $G$ is {\it $n$-existentially closed} if, for all disjoint sets of vertices $A$ and $B$ with $|A\cup B|=n$, there is a vertex $z$ not in $A\cup B$…”
Get full text

The Edge-Connectivity of Vertex-Transitive Hypergraphs by Burgess, Andrea C, Luther, Robert D, Pike, David A

“…A graph or hypergraph is said to be vertex-transitive if its automorphism group acts transitively upon its vertices. A classic theorem of Mader asserts that…”
Get full text