Fetching the paper…
Reading the bibliography…
Let $G$ be a finite connected graph, and let $T$ be a spanning tree of $G$ chosen uniformly at random.
John Mason, Matroids: unimodal conjectures and Motzkin’s theorem . Combinatorics (Proc. Conf. Combinatorial Math., Math. Inst., Oxford, 1972), 207–220, Inst. Math. Appl., Southend-on-Sea, 1972
1972
Earlier work this paper cites.
Paul Seymour, Matroids, hypergraphs, and the max-flow min-cut theorem . Thesis, University of Oxford, 1975
1975
Earlier work this paper cites.
Paul Seymour and Dominic Welsh, Combinatorial applications of an inequality from statistical mechanics . Math. Proc. Cambridge Philos. Soc. 77
1975
Earlier work this paper cites.
Thomas Dowling, On the independent set numbers of a finite matroid . Combinatorics 79 (Proc. Colloq., Univ. Montrál, Montreal, Que., 1979), Part I. Ann. Discrete Math. 8
1980
Earlier work this paper cites.
Paul Seymour, Recognizing graphic matroids . Combinatorica 1
1981
Earlier work this paper cites.
Carolyn Mahoney, On the unimodality of the independent set numbers of a class of matroids , J. Combin. Theory Ser. B 39
1985
Earlier work this paper cites.
Cui Kui Zhao, A conjecture on matroids . Neimenggu Daxue Xuebao 16
1985
Earlier work this paper cites.
Yahya Ould Hamidoune and Isabelle Salaün, On the independence numbers of a matroid . J. Combin. Theory Ser. B 47
1989
Earlier work this paper cites.
Tomás Feder and Milena Mihail, Balanced matroids , Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 26–38, ACM Press, 1992
1992
Earlier work this paper cites.
Robin Pemantle, Uniform random spanning trees . Topics in contemporary probability and its applications, 1–54, Probab. Stochastics Ser., CRC, Boca Raton, FL, 1995
1995
Earlier work this paper cites.
Jeff Kahn, A normal law for matchings . Combinatorica 20
2000
Cited alongside, same era.
Youngbin Choe, James Oxley, Alan Sokal, and David Wagner, Homogeneous multivariate polynomials with the half-plane property . Special issue on the Tutte polynomial. Adv. in Appl. Math. 32
2004
Cited alongside, same era.
David Wagner, Rank-three matroids are Rayleigh . Electron. J. Combin. 12
2005
Cited alongside, same era.
Youngbin Choe and David Wagner, Rayleigh matroids . Combin. Probab. Comput. 15
2006
Cited alongside, same era.
Thomas Cover and Joy Thomas, Elements of information theory . Second edition. Wiley-Interscience, Hoboken, NJ, 2006
2006
Cited alongside, same era.
Mark Jerrum, Two remarks concerning balanced matroids . Combinatorica 26
Jeff Kahn and Michael Neiman, Negative correlation and log-concavity . Random Structures Algorithms 37
2010
Later among the works it cites.
Stasys Jukna, Extremal combinatorics, with applications in computer science . Second edition. Texts in Theoretical Computer Science. Springer, Heidelberg, 2011
2011
Later among the works it cites.
Jeff Kahn and Michael Neiman, A strong log-concavity property for measures on Boolean algebras . J. Combin. Theory Ser. A 118
2011
Later among the works it cites.
James Oxley, Matroid theory . Second edition. Oxford Graduate Texts in Mathematics 21
2011
Later among the works it cites.
June Huh and Eric Katz, Log-concavity of characteristic polynomials and the Bergman fan of matroids . Math. Ann. 354
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
Oliver Johnson, Log-concavity and the maximum entropy property of the Poisson distribution . Stochastic Process. Appl. 117
2007
Cited alongside, same era.
Jim Geelen, Some open problems on excluding a uniform matroid . Adv. in Appl. Math. 41
2008
Cited alongside, same era.
David Wagner, Negatively correlated random variables and Mason’s conjecture for independent sets in matroids . Ann. Comb. 12
2008
Cited alongside, same era.
Julius Borcea, Petter Brändén, and Thomas Liggett, Negative dependence and the geometry of polynomials . J. Amer. Math. Soc. 22
2009
Cited alongside, same era.
Matthias Lenz, The f-vector of a representable-matroid complex is log-concave . Adv. in Appl. Math. 51
2013
Later among the works it cites.
Russell Lyons and Yuval Peres, Probability on trees and networks . Cambridge Series in Statistical and Probabilistic Mathematics 42
2016
Later among the works it cites.
June Huh and Botong Wang, Enumeration of points, lines, planes, etc. Acta Math. 218
2017
Later among the works it cites.
Karim Adiprasito, June Huh, and Eric Katz, Hodge theory for combinatorial geometries . Ann. of Math. (2) 188
2018
Closest in time.
June Huh, Combinatorial applications of the Hodge-Riemann relations . Proceedings of the International Congress of Mathematicians, 2018
2018
Closest in time.