## Abstract

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, every member of each delegation can communicate with every member of the other delegation exactly once. We denote by H(k, 3) the graph describing the communication at one table and by mH(k, 3) the graph consisting of m disjoint copies of H(k,3). We completely characterize all complete bipartite graphs K_{n,n} that can be factorized into factors isomorphic to G = mH(k, 3) for k ≡ 2 (mod 4) by showing that the necessary conditions n = mk and m ≡ 0 mod(3k - 2)/4 are also sufficient. This results complement previous characterizations for k ≡ 0, 1, 3 (mod 4) to settle the problem in full.

Original language | English (US) |
---|---|

Pages (from-to) | 1114-1120 |

Number of pages | 7 |

Journal | Central European Journal of Mathematics |

Volume | 9 |

Issue number | 5 |

DOIs | |

State | Published - Oct 1 2011 |

## Keywords

- Graph decomposition
- Graph factorization
- Oberwolfach problem