Geodesic
Complexes of graphs with bounded matching size
Journal of Algebraic Combinatorics, Tome 27 (2008) no. 3, pp. 331-349.

Voir la notice de l'article provenant de la source Electronic Library of Mathematics

Summary: For positive integers $k, n$, we investigate the simplicial complex $NM _{ k}( n)$ mathsfNM_k$(n)$ 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 $BNM _{ k}( r, s)$ mathsfBNM_k(r,s) of all bipartite graphs $G$ on bipartition $[ r]$ È[[ `$( s)$]] [r]$\cup $[bars] such that there is no matching of size $k$ in $G$, and obtain results similar to those obtained for $NM _{ k}( n)$ mathsfNM_k$(n)$ .
Keywords: keywords critical, trees of triangles, gallai-edmonds 
@article{JAC_2008__27_3_a2,
     author = {Linusson, Svante and Shareshian, John and Welker, Volkmar},
     title = {Complexes of graphs with bounded matching size},
     journal = {Journal of Algebraic Combinatorics},
     pages = {331--349},
     publisher = {mathdoc},
     volume = {27},
     number = {3},
     year = {2008},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JAC_2008__27_3_a2/}
}
TY  - JOUR
AU  - Linusson, Svante
AU  - Shareshian, John
AU  - Welker, Volkmar
TI  - Complexes of graphs with bounded matching size
JO  - Journal of Algebraic Combinatorics
PY  - 2008
SP  - 331
EP  - 349
VL  - 27
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JAC_2008__27_3_a2/
LA  - en
ID  - JAC_2008__27_3_a2
ER  - 
%0 Journal Article
%A Linusson, Svante
%A Shareshian, John
%A Welker, Volkmar
%T Complexes of graphs with bounded matching size
%J Journal of Algebraic Combinatorics
%D 2008
%P 331-349
%V 27
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JAC_2008__27_3_a2/
%G en
%F JAC_2008__27_3_a2
Linusson, Svante; Shareshian, John; Welker, Volkmar. Complexes of graphs with bounded matching size. Journal of Algebraic Combinatorics, Tome 27 (2008) no. 3, pp. 331-349. http://geodesic.mathdoc.fr/item/JAC_2008__27_3_a2/