Cross-Ratios and Projectivities of a Line.
A graph having a perfect matching is called -extendable if every matching of size can be extended to a perfect matching. It is proved that in the hypercube , a matching with can be extended to a perfect matching if and only if it does not saturate the neighbourhood of any unsaturated vertex. In particular, is -extendable for every with
Let be a generalized Petersen graph with , Then every pair of parallel edges of is contained in a 1-factor of . This partially answers a question posed by Larry Cammack and Gerald Schrag [Problem 101, Discrete Math. 73(3), 1989, 311-312].
Page 1