A normal law for matchings

Combinatorica

Volumn 20, Issue 3, 2000, Pages 339-391

  Kahn, Jeff ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040735900     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009835     Document Type: Article

References (49)

1. A. D. BARBOUR, L. HOLST and S. JANSON: Poisson Approximation, Clarendon Press, Oxford, 1992.
2. J. VAN DEN BERG and J. E. STEIF: Percolation and the hard-core lattice gas model, Stochastic Processes and Appl., 49 (1994), 179-197.
3. B. BOLLOBÁS: Modern Graph Theory, Springer, New York, 1998.
4. B. BOLLOBÁS and S. E. ELDRIDGE: Maximal matchings in graphs with given minimal and maximal degrees, Math. Proc. Cambridge Philos. Soc., 79 (1976), 221-234.
5. P. G. DOYLE and J. L. SNELL: Random Walks and Electric Networks, MAA, Washington, 1984.
6. J. EDMONDS: Maximum matching and a polyhedron with 0,1-vertices, J. Res. Nat. Bureau of Standards (B), 69 (1965), 125-130.
7. G. EWALD: Combinatorial Convexity and Algebraic Geometry, Springer 1996.
8. W. FELLER: An Introduction to Probability Theory and its Applications, Vol. 2, Wiley, New York, 1971.
9. Z. FÜREDI: Matchings and covers in hypergraphs, Graphs and Combinatorics, 4 (1988), 115-206.
10. A. GODBOLE: personal communication.
11. C. D. GODSIL: Matching behavior is asymptotically normal, Combinatorica, 1 (1981), 369-376.
12. C. D. GODSIL: Matchings and walks in graphs, J. Graph Theory, 5 (1981), 285-297.
13. J. GOLDMAN, J. JOICHI and D. WHITE: Rook polynomials, Möbius inversion and the umbral calculus, J. Combin. Theory Ser. A, 21 (1976), 230-239.
14. M. GRÖTSCHEL, L. LOVÁSZ and A. SCHRIJVER: Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.
15. P. HALL and C. C. HEYDE: Martingale Limit Theory and its Application, Academic Press, Boston, 1980.
16. L. H. HARPER: Stirling behavior is asymptotically normal, Ann. Math. Stat., 38 (1967), 410-414.
17. O. J. HEILMANN and E. H. LIEB: Monomers and dimers, Phys. Rev. Letters, 24 (1970), 1412-1414.
18. O. J. HEILMANN and E. H. LIEB: Theory of monomer-dimer systems, Comm. Math. Physics, 25 (1972), 190-232.
19. A. JOHANSSON: personal communication.
20. J. KAHN: Recent results on some not-so-recent hypergraph matching and covering problems, pp. 305-353 in: Extremal Problems for Finite Sets, Visegrád, 1991, Bolyai Soc. Math. Studies, 3, 1994. (Distributed by AMS.)
21. J. KAHN: On some hypergraph problems of Paul Erdos and the asymptotics of matchings, covers and colorings, pp. 345-371, in: The Mathematics of Paul Erdos, Vol. 1, Springer, Berlin, 1997.
22. J. KAHN: Asymptotics of hypergraph matching, covering and coloring problems, pp. 1353-1362 in: Proc. Int'l. Cong. of Mathematicians, Zürich, 1994, Birkhäuser Verlag, Basel, 1995.
23. J. KAHN: Asymptotics of the chromatic index for multigraphs, J. Combin. Theory Ser. B, 68 (1996), 233-254.
24. J. KAHN: Asymptotics of the list-chromatic index for multigraphs, submitted.
25. J. KAHN and P. M. KAYLL: On the stochastic independence properties of hard-core distributions, Combinatorica, 7 (1997), 369-391.
26. J. KAHN and P. M. KAYLL: Fractional vs. integer covers in hypergraphs of bounded edge size, J. Combin. Theory Ser. A, 78 (1997), 199-235.
27. J. KAHN and J. H. KIM: Random matchings in regular graphs, Combinatorica, 18 (1998), 201-226.
28. I. KAPLANSKY and J. RIORDAN: The problem of the rooks and its applications, Duke Math. J., 13 (1946), 259-268.
29. H. KUNZ: Location of the zeros of the partition function for some classical lattice systems, Phys. Lett. (A), (1970), 311-312.
30. C. W. LEE: Some recent results on convex polytopes, pp. 3-19, in: Contemporary Mathematics, AMS, 1990.
31. P. LÉVY: Sur une propriété de la loi de Poisson relative aux petites probabilités, Soc. Math, de France, Comptes rendus des scéances de l'année 1936, (1937), 29.
32. P. LÉVY: Théorie de l'Addition des Variables Aléatoires, 2nd ed., Gauthiers-Villars, Paris, 1954.
33. G. M. LOUTH: Stochastic Networks: Complexity, Dependence and Routing, thesis, Cambridge University, 1990.
34. L. LOVÁSZ and M. D. PLUMMER: Matching Theory, North Holland, Amsterdam, 1986.
35. J. H. MASON: Matroids: unimodal conjectures and Motzkin's theorem, pp. 207-221 in: Combinatorics (D.J.A. Welsh and D.R. Woodall, eds.), Inst. Math. & Appl., 1972.
36. M. MIHAIL: On the expansion of combinatorial polytopes, A survey, in: Mathematical Foundations of Computer Science, Prague 1992, Springer-Verlag Lecture Notes in Computer Science, vol. 629, pp. 37-49.
37. A. NIJENHUIS: On permanents and zeros of rook polynomials, J. Combin. Theory Ser. A, 21 (1976), 240-244.
38. J. PITMAN: Probabilistic bounds on the coefficients of polynomials with only real zeros, J. Combin. Theory Ser. A, 77 (1997), 279-303.
39. Y. RABINOVICH, A. SINCLAIR and A. WIGDERSON: Quadratic dynamical systems, Proc. 33rd IEEE Symposium on Foundations of Computer Science, (1992), 304-313.
40. J. RIORDAN: An Introduction to Combinatorial Analysis, Wiley, New York, 1958.
41. i/i! is asymptotically normal, Discrete Math., 49 (1984), 287-290.
42. A. SCHRIJVER: Theory of Linear and Integer Programming, Wiley, Chichester, 1986.
43. C. E. SHANNON: A theorem on coloring the lines of a network, J. Math. Phys., 28 (1949), 148-151.
44. J. SPENCER: Lecture notes, M.I.T., 1987.
45. C. STEIN: Approximate Computation of Expectations, IMS, Hayward CA, 1986.
46. W. T. TUTTE: A problem on spanning trees, Quart. J. Math. Oxford, 25 (1974), 253-255.
47. V. G. VIZING: On an estimate of the chromatic class of a p-graph (in Russian), Diskret. Analiz, 3 (1964), 25-30.
48. D. G. WAGNER: The partition polynomial of a finite set system, J. Combin. Theory Ser. A, 56 (1991), 138-159.
49. D. J. A. WELSH: Matroid Theory, Academic Press, London, 1976.