liu.seSearch for publications in DiVA
Change search

Complexes of graphs with bounded matching size
Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Applied Mathematics.
##### Abstract [en]

For positive integers $k,n$, we investigate the simplicial complex $\nmkn$ of all graphs $G$ on vertex set $[n]$ such that every matching in $G$ has size less than $k$. This complex (along with other associated cell complexes) is found to be homotopy equivalent to a wedge of spheres. The number and dimension of the spheres in the wedge are determined, and (partially conjectural) links to other combinatorially defined complexes are described. In addition we study for positive integers $r,s$ and $k$ the simplicial complex $\bnmkrs$ of all bipartite graphs $G$ on bipartition $[r] \cup [\bar{s}]$ such that there is no matching of size $k$ in $G$, and obtain results similar to those obtained for $\nmkn$.

##### Place, publisher, year, edition, pages
Ithaca: ArXiv.org , 2004.
##### Keyword [en]
matching, homotopy type
Mathematics
##### Identifiers
Local ID: 3099OAI: oai:DiVA.org:liu-23609DiVA: diva2:243924
Available from: 2009-10-07 Created: 2009-10-07

#### Open Access in DiVA

No full text

http://www.arxiv.org/abs/math.CO/0410345

#### Search in DiVA

Linusson, Svante
##### By organisation
The Institute of TechnologyApplied Mathematics
Mathematics