Related papers: On the Generalized Honeymoon Oberwolfach Problem
The Honeymoon Oberwolfach Problem HOP$(2m_1,2m_2,\ldots,2m_t)$ asks the following question. Given $n=m_1+m_2+\ldots +m_t$ newlywed couples at a conference and $t$ round tables of sizes $2m_1,2m_2,\ldots,2m_t$, is it possible to arrange the…
The generalized Oberwolfach problem asks for a factorization of the complete graph $K_v$ into prescribed $2$-factors and at most a $1$-factor. When all $2$-factors are pairwise isomorphic and $v$ is odd, we have the classic Oberwolfach…
The directed Oberwolfach problem OP$^\ast(m_1,\ldots,m_k)$ asks whether the complete symmetric digraph $K_n^\ast$, assuming $n=m_1+\ldots +m_k$, admits a decomposition into spanning subdigraphs, each a disjoint union of $k$ directed cycles…
A king invites n couples to sit around a round table with 2n+1 seats. For each couple, the king decides a prescribed distance d between 1 and n which the two spouses have to be seated from each other (distance d means that they are…
In this paper, we give a solution to the last outstanding case of the directed Oberwolfach problem with tables of uniform length. Namely, we address the two-table case with tables of odd length. We prove that the complete symmetric digraph…
The concept of a $1$-rotational factorization of a complete graph under a finite group $G$ was studied in detail by Buratti and Rinaldi. They found that if $G$ admits a $1$-rotational $2$-factorization, then the involutions of $G$ are…
Motivated by the application of Hall's Marriage Theorem in various LP-rounding problems, we introduce a generalization of the classical marriage problem (CMP) that we call the Fractional Marriage Problem. We show that the Fractional…
We give a new solution of the "homotopy periods" problem, as highlighted by Sullivan, which places explicit geometrically meaningful formulae first dating back to Whitehead in the context of Quillen's formalism for rational homotopy theory…
Promotion has been well-studied for rectangular standard Young tableaux, in which case the orbit lengths divide the total number of boxes and are described by a cyclic sieving phenomenon (CSP), but little is known about the orbit lengths…
The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of $K_{2n+1}$ into edge-disjoint copies of a given $2$-factor. We show that this can be achieved for all large $n$. We actually prove a significantly more general…
In this paper we study variations of the Hopf theorem concerning continuous maps $f$ of a compact Riemannian manifold $M$ of dimension $n$ to $\mathbb{R}^n$. We investigate the case when $M$ is a closed convex $n$-dimensional surface and…
The Kruithof iterative scaling process, which adjusts matrices to meet target row and column sums, is a longstanding problem that lacks a general closed form for its limit. While Nathanson derived the closed form for the Sinkhorn limit of…
Various results on factorisations of complete graphs into circulant graphs and on 2-factorisations of these circulant graphs are proved. As a consequence, a number of new results on the Oberwolfach Problem are obtained. For example, a…
The Hamilton-Waterloo problem asks for a decomposition of the complete graph into $r$ copies of a 2-factor $F_{1}$ and $s$ copies of a 2-factor $F_{2}$ such that $r+s=\left\lfloor\frac{v-1}{2}\right\rfloor$. If $F_{1}$ consists of…
The stable marriage problem with ties is a well-studied and interesting problem in game theory. We are given a set of men and a set of women. Each individual has a preference ordering on the opposite group, which can possibly contain ties.…
A family of permutations called 2-clumped permutations forms a basis for a sub-Hopf algebra of the Malvenuto-Reutenauer Hopf algebra of permutations. The 2-clumped permutations are in bijection with certain decompositions of a square into…
Let $F$ be a $2$-regular graph of order $v$. The Oberwolfach problem $OP(F)$, posed in 1967 and still open, asks for a decomposition of $K_v$ into copies of $F$. In this paper we show that $OP(F)$ has a solution whenever $F$ has a…
We establish a loop space decomposition for certain $CW$-complexes with a single top cell in the presence of a spherical pair, thereby generalizing several known decompositions of Poincar\'{e} duality complexes in which a loop of a product…
Finding schedules for pairwise meetings between the members of a complex social group without creating interpersonal conflict is challenging, especially when different relationships have different needs. We formally define and study the…
We introduce a new and broader formulation of the stable marriage problem (SMP), called the stable polygamy problem (SPP), where multiple individuals from a larger group $L$ of $|L|$ individuals can be matched with a single individual from…