We examine constructions of non-symmetric trees with a flexible q-labeling or an α-like labeling, which allow factorization of into spanning trees, arising from the trees with α-labelings.
We solve the last missing case of a “two delegation negotiation” version of the Oberwolfach problem, which can be stated as follows. Suppose we have two negotiating delegations with n=mk members each and we have a seating arrangement such that every day the negotiators sit at m tables with k people of the same delegation at one side of each table. Every person can effectively communicate just with three nearest persons across the table. Our goal is to guarantee that over the course of several days,...
Page 1