Fetching the paper…
Reading the bibliography…
We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G.
Miroslav Fiedler and Jiří Sedláček, Über Wurzelbasen von gerichteten Graphen, Časopis Pěst. Mat. 83
1958
Earlier work this paper cites.
J.W. Moon, Counting Labeled Trees
1970
Earlier work this paper cites.
L.W. Beineke and R.E. Pippert, Properties and characterizations of k k -trees, Mathematika 18
1971
Earlier work this paper cites.
A.K. Dewdney, Higher-dimensional tree structures, J. Comb. Theory Ser. B 17
1974
Earlier work this paper cites.
Ethan Bolker, Simplicial geometry and transportation polytopes, Trans. Amer. Math. Soc. 217
1976
Earlier work this paper cites.
Gerald Reisner, Cohen-Macaulay quotients of polynomial rings, Adv. Math
1976
Earlier work this paper cites.
Gil Kalai, Enumeration of 𝐐 {\bf Q} -acyclic simplicial complexes, Israel J. Math. 45
1983
Earlier work this paper cites.
Anders Björner and Gil Kalai, An extended Euler-Poincaré theorem, Acta Math. 161
1988
Earlier work this paper cites.
Ron Adin, Counting colorful multi-dimensional trees, Combinatorica 12
1992
Earlier work this paper cites.
A. Björner, L. Lovász, S.T. Vrećica, and R.T. Živaljević, Chessboard complexes and matching complexes, J. London Math. Soc. (2) 49
1994
Earlier work this paper cites.
N.V.R. Mahadev and U.N. Peled, Threshold graphs and related topics . Annals of Discrete Mathematics, 56. North-Holland Publishing Co., Amsterdam, 1995
1995
Earlier work this paper cites.
Richard P. Stanley, Combinatorics and Commutative Algebra , 2nd edn., Birkhäuser, Boston, 1996
1996
Cited alongside, same era.
Richard P. Stanley, Enumerative Combinatorics, volume I . Cambridge Studies in Advanced Mathematics, 49. Cambridge University Press, 1997
1997
Cited alongside, same era.
Béla Bollobás, Modern Graph Theory
1998
Cited alongside, same era.
Joel Friedman and Phil Hanlon, On the Betti numbers of chessboard complexes, J. Algebraic Combin. 8
1998
Cited alongside, same era.
Jürgen Herzog and Enzo Maria Li Marzi, Bounds for the Betti numbers of shellable simplicial complexes and polytopes, Commutative algebra and algebraic geometry (Ferrara)
1999
Cited alongside, same era.
Gil Kalai, Algebraic shifting, Computational commutative algebra and combinatorics (Osaka, 1999) , 121–163, Adv. Stud. Pure Math., 33, Math. Soc. Japan, Tokyo, 2002
2002
Later among the works it cites.
W. Kook, V. Reiner, and D. Stanton, Combinatorial Laplacians of matroid complexes, J. Amer. Math. Soc. 13
2002
Later among the works it cites.
Gregor Masbaum and Arkady Vaintrob, A new matrix-tree theorem, Int. Math. Res. Not. 2002
2002
Later among the works it cites.
Jeffrey B. Remmel and S. Gill Williamson, Spanning trees and function classes, Electron. J. Combin. 9
2002
Later among the works it cites.
Jeremy L. Martin and Victor Reiner, Factorization of some weighted spanning tree enumerators, J. Combin. Theory Ser. A 104
2003
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1999
Cited alongside, same era.
2001
Cited alongside, same era.
Xun Dong and Michelle L. Wachs, Combinatorial Laplacian of the matching complex, Electron. J. Combin. 9
2002
Cited alongside, same era.
Art M. Duval and Victor Reiner, Shifted simplicial complexes are Laplacian integral, Trans. Amer. Math. Soc. 354
2002
Cited alongside, same era.
Sara Faridi, The facet ideal of a simplicial complex, Manuscripta Math. 109
2002
Cited alongside, same era.
Allen Hatcher, Algebraic Topology . Cambridge University Press, Cambridge, 2002. Also available online at http://www.math.cornell.edu/ ∼ \sim hatcher/AT/ATpage.html
2002
Cited alongside, same era.
Arthur Cayley, A theorem on trees, Quart. J. Math. 23
Cited in the paper.
Eric Babson and Isabella Novik, Face numbers and nongeneric initial ideals, Electron. J. Combin. 11
2004
Later among the works it cites.
Art M. Duval, A relative Laplacian spectral recursion, Electron. J. Combin. 11
2004
Later among the works it cites.
Richard Ehrenborg and Stephanie van Willigenburg, Enumerative properties of Ferrers graphs, Discrete Comput. Geom. 32
2004
Later among the works it cites.
Caroline Klivans, Obstructions to shiftedness, Discrete Comput. Geom. 33
2005
Later among the works it cites.
Jeremy L. Martin and Victor Reiner, Cyclotomic and simplicial matroids, Israel J. Math. 150
2005
Later among the works it cites.
Matthias Beck and Serkan Hoşten, Cyclotomic polytopes and growth series of cyclotomic lattices, Math. Res. Lett. 13
2006
Later among the works it cites.