liu.seSearch for publications in DiVA

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

Generalised Ramsey numbers for two sets of cyclesPrimeFaces.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();
}
}
(English)Manuscript (preprint) (Other academic)
##### Abstract [en]

##### Keywords [en]

Generalised Ramsey number, critical graph, cycle, set of cycles
##### National Category

Mathematics
##### Identifiers

URN: urn:nbn:se:liu:diva-123042OAI: oai:DiVA.org:liu-123042DiVA, id: diva2:876248
#####

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

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

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt504",{id:"formSmash:j_idt504",widgetVar:"widget_formSmash_j_idt504",multiple:true}); Available from: 2015-12-03 Created: 2015-12-03 Last updated: 2015-12-03Bibliographically approved
##### In thesis

We determine several generalised Ramsey numbers for two sets Γ_{1} and Γ_{2} of cycles, in particular, all generalised Ramsey numbers R(Γ_{1}, Γ_{2}) such that Γ_{1} or Γ_{2} contains a cycle of length at most 6, or the shortest cycle in each set is even. This generalises previous results of Erdös, Faudree, Rosta, Rousseau, and Schelp from the 1970s. Notably, including both C_{3} and C_{4} in one of the sets, makes very little difference from including only C_{4}. Furthermore, we give a conjecture for the general case. We also describe many (Γ_{1}, Γ_{2})-avoiding graphs, including a complete characterisation of most (Γ_{1}, Γ_{2})-critical graphs, i.e., (Γ_{1}, Γ_{2})-avoiding graphs on R(Γ_{1}, Γ_{2}) − 1 vertices, such that Γ_{1} or Γ_{2} contains a cycle of length at most 5. For length 4, this is an easy extension of a recent result of Wu, Sun, and Radziszowski, in which |Γ_{1}| = |Γ_{2}| = 1. For lengths 3 and 5, our results are new even in this special case.

1. Generalised Ramsey numbers and Bruhat order on involutions$(function(){PrimeFaces.cw("OverlayPanel","overlay876270",{id:"formSmash:j_idt783:0:j_idt787",widgetVar:"overlay876270",target:"formSmash:j_idt783:0:parentLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

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

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