- Full text PDF available (3)
- This year (0)
- Last 5 years (0)
- Last 10 years (1)
An odd neighborhood transversal of a graph is a set of its vertices that intersects the set of neighbors of each of its vertices in an odd number of elements. In the case of grid graphs this odd number will be either one or three. We characterize those grid graphs that have odd neighborhood transversals.
Define a simple graph G to be k-superuniversal iff for any k-element simple graph K and for any full subgraph H of K every full embedding of H into G can be extended to a full embedding of K into G. We prove that for each positive integer k there exist finite k-superuniversal graphs, and e find upper and looer bounds on the smallest such graphs. We also… (More)
In his paper on subsets of the series of natural numbers N. Lusin  defines two sets F, G g co to be orthogonal (F I G) iff F c3 G is finite. A family (henceforth the term family will be used only to denote subsets of the power set of co) is said to be internally orthogonal iff for any two distinct members F, G of ~ we have F 2. G. Two families ~ and ~… (More)