Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Shareshian, John"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
From Bruhat intervals to intersection lattices and a conjecture of Postnikov
Axel Hultman
,
Svante Linusson
,
John Shareshian
,
Jonas Sjöstrand
Journal of Combinatorial Theory Series A
116
(3), 2009, pp. 564-580
Hypergraph matching complexes and Quillen complexes of symmetric groups
John Shareshian
Journal of Combinatorial Theory Series A
106
(2), 2004, pp. 299-314
Complexes of
t
-colorable graphs
Svante Linusson
,
John Shareshian
SIAM Journal on Discrete Mathematics
16
(3), 2003, pp. 371-389
Topology of subgroup lattices of symmetric and alternating groups
John Shareshian
Journal of Combinatorial Theory Series A
104
(3), 2003, pp. 137-155
Links in the complex of separable graphs
John Shareshian
Journal of Combinatorial Theory Series A
88
(1), 1999, pp. 54-65
On the Möbius number of the subgroup lattice of the summetric group
John Shareshian
Journal of Combinatorial Theory Series A
78
(2), 1997, pp. 236-267