Linusson, Svante - Department of Mathematics, Royal Institute of Technology (KTH)

Advanced Search

Linusson, Svante - Department of Mathematics, Royal Institute of Technology (KTH)

PATTERN AVOIDANCE IN ALTERNATING SIGN ROBERT JOHANSSON AND SVANTE LINUSSON
OBIUS FUNCTIONS AND CHARACTERISTIC POLYNOMIALS FOR SUBSPACE ARRANGEMENTS EMBEDDED IN B n
A PROOF OF PARISI'S CONJECTURE ON THE RANDOM ASSIGNMENT PROBLEM
UDDATALSMETODEN OCH VALSYSTEM SVANTE LINUSSON
THOMASSEN'S CHOOSABILITY ARGUMENT REVISITED DAVID R. WOOD AND SVANTE LINUSSON
arXiv:1003.4728v2[math.CO]13Jul2010 n! MATCHINGS, n! POSETS
A NOTE ON CORRELATIONS IN RANDOMLY ORIENTED GRAPHS
ON PERCOLATION AND THE BUNKBED CONJECTURE SVANTE LINUSSON
The k-assignment polytope Jonna Gill
ON THE INDEPENDENCE COMPLEX OF SQUARE GRIDS MIREILLE BOUSQUET-MLOU, SVANTE LINUSSON, AND ERAN NEVO
DENSE PACKING OF PATTERNS IN A PERMUTATION HENRIK ERIKSSON, KIMMO ERIKSSON, SVANTE LINUSSON,
Stockholms Matematikcentrum Svante Linusson
PARITY SPLITS BY TRIPLE POINT DISTANCES IN ORGEN BACKELIN AND SVANTE LINUSSON
CORRELATIONS FOR PATHS IN RANDOM ORIENTATIONS OF G(n, p) AND G(n, m)
COMPLETING A k 1 ASSIGNMENT SVANTE LINUSSON 1
FROM BRUHAT INTERVALS TO INTERSECTION LATTICES AND A CONJECTURE OF POSTNIKOV
Proportionalitet och valmatematik Svante Linusson
A regular decomposition of the edgeproduct space of phylogenetic trees
n! MATCHINGS, n! POSETS ANDERS CLAESSON AND SVANTE LINUSSON
COMBINATORICS OF FULTON'S ESSENTIAL SET KIMMO ERIKSSON AND SVANTE LINUSSON
arXiv:1104.2137v1[math.PR]12Apr2011 THE PROBABILITY OF THE ALABAMA PARADOX
A GENERALIZATION OF THE RANDOM ASSIGNMENT SVANTE LINUSSON AND JOHAN W
DOI: 10.1007/s00454-001-0011-5 Discrete Comput Geom 26:173181 (2001) Discrete & Computational
Discrete Comput Geom 21:116 (1999) Discrete & Computational Geometry 1999 Springer-Verlag New York Inc.
EXAMPLES OF NON-UNIQUENESS FOR THE COMBINATORIAL RADON TRANSFORM
COMPLEXES OF GRAPHS WITH BOUNDED MATCHING SIZE
MO"BIUS FUNCTIONS AND CHARACTERISTIC POLYNOMIALS FOR SUBSPACE ARRANGEMENTS EMBEDDED IN Bn
A PROOF OF PARISI'S CONJECTURE ON THE RANDOM ASSIGNMENT PROBLEM