<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-PQ3QJVUG/43fe81d2-c98f-49e6-b545-1b9617de9800/PDF"><dcterms:extent>379 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-PQ3QJVUG/3326b5cf-c982-4829-8f8a-bf631a2425b9/TEXT"><dcterms:extent>22 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2008-2025"><edm:begin xml:lang="en">2008</edm:begin><edm:end xml:lang="en">2025</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-PQ3QJVUG"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2019</dcterms:issued><dc:creator>Keranen, Melissa S.</dc:creator><dc:creator>Pastine, Adrián</dc:creator><dc:format xml:lang="sl">letnik:17</dc:format><dc:format xml:lang="sl">številka:2</dc:format><dc:format xml:lang="sl">str. 525-533</dc:format><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>COBISSID_HOST:18963801</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-PQ3QJVUG</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</dc:publisher><dcterms:isPartOf xml:lang="sl">Ars mathematica contemporanea</dcterms:isPartOf><dc:subject xml:lang="en">2-factorizations</dc:subject><dc:subject xml:lang="sl">2-faktorizacija</dc:subject><dc:subject xml:lang="sl">ciklična dekompozicija</dc:subject><dc:subject xml:lang="en">cycle decomposition</dc:subject><dc:subject xml:lang="sl">hamiltonsko-waterloojski problem</dc:subject><dc:subject xml:lang="en">Hamilton-Waterloo problem</dc:subject><dc:subject xml:lang="en">Oberwolfach problem</dc:subject><dc:subject xml:lang="sl">oberwolfaški problem</dc:subject><dc:subject xml:lang="en">resolvable decompositions</dc:subject><dc:subject xml:lang="sl">rešljiva dekompozicija</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity|</dc:title><dc:description xml:lang="sl">The Hamilton-Waterloo problem asks for a decomposition of the complete graph of order ?$v$? into ?$r?$ copies of a 2-factor ?$F_1$? and ?$s$? copies of a 2-factor ?$F_2$? such that ?$r +s = \lfloor\frac{ (v - 1)}{2} \rfloor $?. If ?$F_1$? consists of ?$m$?-cycles and ?$F_2$? consists of ?$n$? cycles, we say that a solution to ?$(m, n)- \text{HWP}(v; r, s)$? exists. The goal is to find a decomposition for every possible pair ?$(r, s)$?. In this paper, we show that for odd ?$x$? and ?$y$?, there is a solution to ?$(2^kx, y) -\text{HWP}(vm; r, s)$? if ?$\gcd (x, y) \geq 3$?, ?$m\geq 3$?, and both ?$x$? and ?$y$? divide ?$v$?, except possibly when ?$1 \in \{r, s\}$?</dc:description><dc:description xml:lang="sl">Hamiltonsko-waterloojski problem sprašuje po dekompoziciji polnega grafa reda ?$v$? na ?$r$? kopij 2-faktorja ?$F_1$? in s kopij 2-faktorja ?$F_2$?, pri čemer je ?$r +s = \lfloor\frac{ (v - 1)}{2} \rfloor $?. Če ?$F_1$? sestoji iz ?$m$?-ciklov in ?$F_2$? sestoji iz ?$n$? ciklov, pravimo, da rešitev za ?$(m, n)- \text{HWP}(v; r, s)$? obstaja. Cilj je najti dekompozicijo za vsak možen par ?$(r, s)$?. V članku pokažemo, da za liha ?$x$? in ?$y$? obstaja rešitev za ?$(2^kx, y) -\text{HWP}(vm; r, s)$?, če je ?$\gcd (x, y) \geq 3$?, ?$m\geq 3$? in tako ?$x$? kot ?$y$? delita ?$v$?, razen morda, ko je ?$1 \in \{r, s\}$?</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-PQ3QJVUG"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-PQ3QJVUG" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-PQ3QJVUG/43fe81d2-c98f-49e6-b545-1b9617de9800/PDF" /><edm:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-PQ3QJVUG/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-PQ3QJVUG" /></ore:Aggregation></rdf:RDF>