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

Simplicial Complexes of GraphsPrimeFaces.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();
}
}
2005 (English)Doctoral thesis, monograph (Other scientific)
##### Abstract [en]

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

Stockholm: KTH , 2005. , p. xiii, 350
##### Series

Trita-MAT. MA, ISSN 1401-2278 ; 05:07
##### Keywords [en]

Algebra and geometry, simplicial complex, monotone graph property, discrete Morse theory, simplicial homology, homotopy type, connectivity degree, Cohen-Macaulay complex, Euler characteristic, decision tree
##### Keywords [sv]

Algebra och geometri
##### National Category

Mathematics
##### Identifiers

URN: urn:nbn:se:kth:diva-202ISBN: 91-7178-048-3 (print)OAI: oai:DiVA.org:kth-202DiVA, id: diva2:7886
##### Public defence

2005-05-25, E1, E, Osquars backe 2 nb, Stockholm, 15:00
##### Opponent

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt825",{id:"formSmash:j_idt825",widgetVar:"widget_formSmash_j_idt825",multiple:true});
##### Supervisors

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

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt852",{id:"formSmash:j_idt852",widgetVar:"widget_formSmash_j_idt852",multiple:true});
##### Note

QC 20100622Available from: 2005-05-16 Created: 2005-05-16 Last updated: 2010-07-15Bibliographically approved

Let* G* be a finite graph with vertex set *V* and edge set E. A* graph complex* on *G* is an abstract simplicial complex consisting of subsets of *E*. In particular, we may interpret such a complex as a family of subgraphs of *G*. The subject of this thesis is the topology of graph complexes, the emphasis being placed on homology, homotopy type, connectivity degree, Cohen-Macaulayness, and Euler characteristic.

We are particularly interested in the case that *G* is the complete graph on *V*. *Monotone graph properties* are complexes on such a graph satisfying the additional condition that they are invariant under permutations of *V*. Some well-studied monotone graph properties that we discuss in this thesis are complexes of matchings, forests, bipartite graphs, disconnected graphs, and not 2-connected graphs. We present new results about several other monotone graph properties, including complexes of not 3-connected graphs and graphs not coverable by *p* vertices.

Imagining the vertices as the corners of a regular polygon, we obtain another important class consisting of those graph complexes that are invariant under the natural action of the dihedral group on this polygon. The most famous example is the associahedron, whose faces are graphs without crossings inside the polygon. Restricting to matchings, forests, or bipartite graphs, we obtain other interesting complexes of noncrossing graphs. We also examine a certain "dihedral" variant of connectivity.

The third class to be examined is the class of digraph complexes. Some well-studied examples are complexes of acyclic digraphs and not strongly connected digraphs. We present new results about a few other digraph complexes, including complexes of graded digraphs and non-spanning digraphs.

Many of our proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this thesis provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees, which we successfully apply to a large number of graph and digraph complexes.

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

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