Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:Transforming solutions for the Oberwolfach problem into solutions for the spouse-loving variant
Authors:ID Lekše, Maruša (Author)
ID Šajna, Mateja (Author)
Files:.pdf PDF - Presentation file, download (4,34 MB)
MD5: 6E432EE6972DF5B89D1C46133E5D40A8
 
URL URL - Source URL, visit https://onlinelibrary.wiley.com/doi/10.1002/jcd.70020
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:The Oberwolfach problem ${\mathrm {OP}}(F)$, for a $2$-factor $F$ of $K_n$, asks whether there exists a $2$-factorization of $K_n$ (if $n$ is odd) or $K_n-I$ (if $n$ is even) where each $2$-factor is isomorphic to $F$. Here, $I$ denotes any $1$-factor of $K_n$. For even $n$, the problem ${\mathrm {OP}}(F)$ may also be denoted ${\mathrm {OP}}^-(F)$, and has been nicknamed the spouse-avoiding variant. Similarly, the spouse-loving variant is denoted ${\mathrm {OP}}^+(F)$ and asks for a $2$-factorization of $K_n + I$ (the complete graph with the edges of a $1$-factor $I$ duplicated, rather than deleted) in which each $2$-factor is isomorphic to $F$. To date, many more infinite families of cases of ${\mathrm {OP}}$ and ${\mathrm {OP}}^-$ have been solved than of ${\mathrm {OP}}^+(F)$. In this paper, we show how certain solutions to ${\mathrm {OP}}^-(F)$ can be used to construct solutions to ${\mathrm {OP}}^+(F)$; in particular, when the number of odd cycles in the $2$-factor $F$ is not too large. Our technique of setups also allows us to completely solve the two-table ${\mathrm {OP}}^+$; that is, ${\mathrm {OP}}^+(F)$, where $F$ has exactly two components.
Keywords:1‐rotational solution, 12‐setup, 2‐factorization, 2‐starter, 6‐setup, complete graph plus a 1‐factor, Oberwolfach problem, spouse‐loving variant
Publication status:Published
Publication version:Version of Record
Publication date:01.08.2026
Year of publishing:2026
Number of pages:str. 361-377
Numbering:Vol. 34, iss. 8
PID:20.500.12556/DiRROS-31266 New window
UDC:519.17
ISSN on article:1063-8539
DOI:10.1002/jcd.70020 New window
COBISS.SI-ID:285786371 New window
Publication date in DiRROS:23.07.2026
Views:162
Downloads:146
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Journal of combinatorial designs
Shortened title:J. comb. des.
Publisher:J. Wiley & Sons
ISSN:1063-8539
COBISS.SI-ID:15158021 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0294
Name:Računsko intenzivne metode v teoretičnem računalništvu, diskretni matematiki, kombinatorični optimizaciji ter numerični analizi in algebri z uporabo v naravoslovju in družboslovju

Funder:Other - Other funder or multiple funders
Funding programme:Natural Sciences and Engineering Research Council of Canada
Project number:RGPIN‐2022‐02994
Name:Transforming Solutions for the Oberwolfach Problem into Solutions for the directed Oberwolfach Problem

Licences

License:CC BY-NC 4.0, Creative Commons Attribution-NonCommercial 4.0 International
Link:http://creativecommons.org/licenses/by-nc/4.0/
Description:A creative commons license that bans commercial use, but the users don’t have to license their derivative works on the same terms.

Back