Largest Planar Matching in Random Bipartite Graphs

Random Structures and Algorithms

Volumn 21, Issue 2, 2002, Pages 162-181

  Kiwi, Marcos ^a   Loebl, Martin ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Longest common subsequence; Longest increasing subsequence; Random bipartite graphs

Indexed keywords

EID: 0036362029     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10048     Document Type: Article

References (23)

1. K. S. Alexander, The rate of convergence of the mean length of the longest common subsequence, Ann Appl Probab 4(4) (January 1994), 1074-1082.
2. J. Baik, P. A. Deift, and K. Johansson, On the distribution of the length of the longest increasing subsequence of random permutations, J Am Math Soc 12 (1999), 1119-1178.
3. R. Baeza-Yates, G. Navarro, R. Gavaldá, and R. Schehing, Bounding the expected length of the longest common subsequences and forests, Theory Comput Syst 32(4) (1999), 435-452.
4. B. Bollobás, Random graphs, Academic Press, New York, 1985.
5. B. Bollobás and P. Winkler, The longest chain among random points in Euclidean space, Proc Am Math Soc 103(2) (June 1988), 347-353.
6. V. Chvátal and D. Sankoff, Longest common subsequences of two random sequences, J Appl Probab 12 (1975), 306-315.
7. D. Dubhashi and D. Ranjan, Balls and bins: A study in negative dependence, Random Struct Alg 13(2) (1998), 99-124.
8. P. Erdos and G. K. Szekeres, A combinatorial problem in geometry, Compositio Math 2 (1935), 463-470.
9. R. L. Graham, M. Grötschel, and L. Lovász (Editors), Handbook of combinatorics, 1st ed, MIT Press/North-Holland, Cambridge, MA/Amsterdam, 1995, Vol. I.
10. G. R. Grimmett and D. R. Stirzaker, Probability and random processes, 2nd ed, Oxford Science Publications, Oxford University Press, Oxford, 1992.
11. J. M. Hammersley, "A few seedlings of research," Proc Sixth Berkeley Symp Math Stat Prob, Berkeley, CA, University of California Press, Berkeley, 1972, pp. 345-394.
12. S. Janson, Random regular graphs: Asymptotic distributions and contiguity, Combinat Probab Comput 4(4) (1995), 369-405.
13. J. H. Kim, On increasing subsequences of random permutations, J Combinat Theory A 76 (1996), 148-155.
14. J. F. C. Kingman, Subadditive ergodic theory, Ann Probab 1(6) (1973), 883-909.
15. B. F. Logan and L. A. Shepp, A variational problem or random Young tableaux, Adv Math 26 (1977), 206-222.
16. B. D. McKay, Asymptotics for 0-1 matrices with prescribed line sums, Enumeration and design, Academic Press, New York, 1984, pp. 225-238.
17. 1/2), Combinatorica 11(4) (1991), 369-382.
18. S. Pilpel, Descending subsequences of random permutations, J Combinat Theory A 53 (1990), 96-116.
19. S. Ross, A first course in probability, Yorktown Heights, NY, 3rd ed, Macmillan, New York, 1988.
20. C. Schensted, Longest increasing and decreasing subsequences, Can J Math 13 (1961), 179-191.
21. d, Ann Probab 5(3) (1977), 395-403.
22. A. M. Vershik and S. V. Kerov, Asymptotics of the Plancherel measure of the symmetric group and the limiting form of Young tableaux, Dokl Akad Nauk SSSR 233 (1977), 1024-1028.
23. X. Wang, Asymptotic enumeration of bipartite graphs, tournaments, digraphs, and eulerian digraphs with multiple edges, Ph.D. Thesis, Australian National University, Canberra, Australia, 1991.