메뉴 건너뛰기
Journal of Combinatorial Theory. Series A
Volumn 115, Issue 1, 2008, Pages 32-66
Asymptotic enumeration of dense 0-1 matrices with specified line sums
Author keywords

0 1 matrix; Asymptotic enumeration; Binary matrix; Bipartite graph
Indexed keywords

EID: 36248938581     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2007.03.009     Document Type: Article
Times cited : (43)
References (10)
  • 1
    • 21344445019 scopus 로고    scopus 로고
    • Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
    • Canfield E.R., and McKay B.D. Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums. Electron. J. Combin. 12 (2005) #R29
    • (2005) Electron. J. Combin. , vol.12
    • Canfield, E.R.1    McKay, B.D.2
  • 2
    • 30544437318 scopus 로고    scopus 로고
    • Asymptotic enumeration of sparse irregular bipartite graphs
    • Greenhill C., McKay B.D., and Wang X. Asymptotic enumeration of sparse irregular bipartite graphs. J. Combin. Theory Ser. A 113 (2006) 291-324
    • (2006) J. Combin. Theory Ser. A , vol.113 , pp. 291-324
    • Greenhill, C.1    McKay, B.D.2    Wang, X.3
  • 3
    • 84947403595 scopus 로고
    • Probability inequalities for sums of bounded random variables
    • Hoeffding W. Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58 (1963) 13-30
    • (1963) J. Amer. Statist. Assoc. , vol.58 , pp. 13-30
    • Hoeffding, W.1
  • 4
    • 0011455489 scopus 로고
    • The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
    • McKay B.D. The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs. Combinatorica 10 (1990) 367-377
    • (1990) Combinatorica , vol.10 , pp. 367-377
    • McKay, B.D.1
  • 5
    • 0542423544 scopus 로고    scopus 로고
    • Asymptotic enumeration of Eulerian circuits in the complete graph
    • McKay B.D., and Robinson R.W. Asymptotic enumeration of Eulerian circuits in the complete graph. Combin. Probab. Comput. 7 (1998) 437-449
    • (1998) Combin. Probab. Comput. , vol.7 , pp. 437-449
    • McKay, B.D.1    Robinson, R.W.2
  • 6
    • 0029692641 scopus 로고    scopus 로고
    • Asymptotic enumeration of tournaments with a given score sequence
    • McKay B.D., and Wang X. Asymptotic enumeration of tournaments with a given score sequence. J. Combin. Theory Ser. A 73 (1996) 77-90
    • (1996) J. Combin. Theory Ser. A , vol.73 , pp. 77-90
    • McKay, B.D.1    Wang, X.2
  • 7
    • 0141569517 scopus 로고    scopus 로고
    • Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
    • McKay B.D., and Wang X. Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums. Linear Algebra Appl. 373 (2003) 273-288
    • (2003) Linear Algebra Appl. , vol.373 , pp. 273-288
    • McKay, B.D.1    Wang, X.2
  • 8
    • 84996454498 scopus 로고
    • Asymptotic enumeration by degree sequence of graphs of high degree
    • McKay B.D., and Wormald N.C. Asymptotic enumeration by degree sequence of graphs of high degree. European J. Combin. 11 (1990) 565-580
    • (1990) European J. Combin. , vol.11 , pp. 565-580
    • McKay, B.D.1    Wormald, N.C.2
  • 9
    • 0034226242 scopus 로고    scopus 로고
    • Two-dimensional weight-constrained codes through enumeration bounds
    • Ordentlich E., and Roth R.M. Two-dimensional weight-constrained codes through enumeration bounds. IEEE Trans. Inform. Theory 46 (2000) 1292-1301
    • (2000) IEEE Trans. Inform. Theory , vol.46 , pp. 1292-1301
    • Ordentlich, E.1    Roth, R.M.2

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.