Search Results

You are looking at 1 - 2 of 2 items for

  • Author or Editor: R. C. Entringer x
Clear All Modify Search

For small values of n it is easily seen that the components of a bigraph on 2n points are themselves bigraphs of their point set.Simmons had asked whether this was always the case and had shown that if a bigraph on 2n points existed which had a component that was not in itself a bigraph then 2n≧16. In this paper we answer his question affirmatively by using a result ofLovász. We also show that any two components of a bigraph intersect.

Restricted access
Restricted access