umu.sePublications

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt152",{id:"formSmash:upper:j_idt152",widgetVar:"widget_formSmash_upper_j_idt152",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt153_j_idt155",{id:"formSmash:upper:j_idt153:j_idt155",widgetVar:"widget_formSmash_upper_j_idt153_j_idt155",target:"formSmash:upper:j_idt153:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Latin cubes with forbidden entriesPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
2019 (English)In: The Electronic Journal of Combinatorics, ISSN 1097-1440, E-ISSN 1077-8926, Vol. 26, no 1, article id P1.2Article in journal (Refereed) Published
##### Abstract [en]

##### Place, publisher, year, edition, pages

Newark: Department of Mathematical Science, University of Delaware , 2019. Vol. 26, no 1, article id P1.2
##### National Category

Discrete Mathematics
##### Research subject

Mathematics
##### Identifiers

URN: urn:nbn:se:umu:diva-147511ISI: 000456790800002OAI: oai:DiVA.org:umu-147511DiVA, id: diva2:1203765
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt451",{id:"formSmash:j_idt451",widgetVar:"widget_formSmash_j_idt451",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt457",{id:"formSmash:j_idt457",widgetVar:"widget_formSmash_j_idt457",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt463",{id:"formSmash:j_idt463",widgetVar:"widget_formSmash_j_idt463",multiple:true});
##### Funder

Swedish Research Council, 2014-4897
##### Note

##### In thesis

We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant y>0 such that if n=2^{k} and A is a 3-dimensional n×n×n array where every cell contains at most γn symbols, and every symbol occurs at most γn times in every line of A, then A is avoidable; that is, there is a Latin cube L of order n such that for every 1 ≤ i,j,k ≤ n, the symbol in position (i,j,k) of L does not appear in the corresponding cell of A.

Originally included in thesis in manuscript form.

Available from: 2018-05-04 Created: 2018-05-04 Last updated: 2019-04-24Bibliographically approved1. On avoiding and completing edge colorings$(function(){PrimeFaces.cw("OverlayPanel","overlay1203795",{id:"formSmash:j_idt741:0:j_idt745",widgetVar:"overlay1203795",target:"formSmash:j_idt741:0:parentLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

2. On avoiding and completing colorings$(function(){PrimeFaces.cw("OverlayPanel","overlay1306676",{id:"formSmash:j_idt741:1:j_idt745",widgetVar:"overlay1306676",target:"formSmash:j_idt741:1:parentLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1180",{id:"formSmash:j_idt1180",widgetVar:"widget_formSmash_j_idt1180",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1234",{id:"formSmash:lower:j_idt1234",widgetVar:"widget_formSmash_lower_j_idt1234",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1235_j_idt1237",{id:"formSmash:lower:j_idt1235:j_idt1237",widgetVar:"widget_formSmash_lower_j_idt1235_j_idt1237",target:"formSmash:lower:j_idt1235:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});