SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Computational Geometry: Theory and Applications

Volumn 8, Issue 5, 1997, Pages 267-277

On the number of simplicial complexes in ℝd

(2) Dey, Tamal K a Shah, Nimish R b

a INDIAN INSTITUTE OF TECHNOLOGY (India)

b MENTOR GRAPHICS CORPORATION (United States)

Author keywords

D dimensions; Discrete geometry; Extremal problems; Simplicial complexes

Indexed keywords

EID: 0039506256 PISSN: 09257721 EISSN: None Source Type: Journal
DOI: 10.1016/S0925-7721(97)00007-2 Document Type: Article

Times cited : (16)

References (13)

1
- 0002003776
- Crossing-free subgraphs
- M. Ajtai, V. Chvátal, M.M. Newborn and E. Szemerédi, Crossing-free subgraphs, Ann. Discrete Math. 12 (1982) 9-12.
- (1982) Ann. Discrete Math. , vol.12 , pp. 9-12
- Ajtai, M.¹ Chvátal, V.² Newborn, M.M.³ Szemerédi, E.⁴

2
- 0039331818
- Empty simplices in Euclidean space
- I. Bárány and Z. Füredi, Empty simplices in Euclidean space, Canad. Math. Bull. 30 (1987) 436-445.
- (1987) Canad. Math. Bull. , vol.30 , pp. 436-445
- Bárány, I.¹ Füredi, Z.²

3
- 0039924172
- Triangulated n-manifolds are determined by their ⌊n/2⌋ + 1-skeletons
- J. Dancis, Triangulated n-manifolds are determined by their ⌊n/2⌋ + 1-skeletons, Topology Appl. 18 (1984) 17-26.
- (1984) Topology Appl. , vol.18 , pp. 17-26
- Dancis, J.¹

4
- 38248999965
- On counting triangulations in d dimensions
- T.K. Dey, On counting triangulations in d dimensions, Computational Geometry: Theory and Applications 3 (1993) 315-325.
- (1993) Computational Geometry: Theory and Applications , vol.3 , pp. 315-325
- Dey, T.K.¹

5
- 51249163392
- Counting triangle crossings and halving planes
- T.K. Dey and H. Edelsbrunner, Counting triangle crossings and halving planes. Discrete Comput. Geom. 12 (1994) 281-289.
- (1994) Discrete Comput. Geom. , vol.12 , pp. 281-289
- Dey, T.K.¹ Edelsbrunner, H.²

6
- 0003516674
- Springer, Berlin
- H. Edelsbrunner, Algorithms in Combinatorial Geometry (Springer, Berlin, 1987).
- (1987) Algorithms in Combinatorial Geometry
- Edelsbrunner, H.¹

7
- 0000049892
- d
- d, Discrete Comput. Geom. 1 (1986) 219-227.
- (1986) Discrete Comput. Geom. , vol.1 , pp. 219-227
- Goodman, J.E.¹ Pollack, R.²

8
- 0002496654
- Many triangulated spheres
- G. Kalai, Many triangulated spheres, Discrete Comput. Geom. 3 (1988) 1-14.
- (1988) Discrete Comput. Geom. , vol.3 , pp. 1-14
- Kalai, G.¹

9
- 84968521041
- On Dedekind's problem: The number of monotone Boolean functions
- D.J. Kleitman, On Dedekind's problem: the number of monotone Boolean functions, Proc. Amer. Math. Soc. 21 (1969) 677-682.
- (1969) Proc. Amer. Math. Soc. , vol.21 , pp. 677-682
- Kleitman, D.J.¹

10
- 0002017397
- On the number of monotone Boolean functions
- A.D. Korshunov, On the number of monotone Boolean functions, Problemy Kibernet. 38 (1981) 5-108.
- (1981) Problemy Kibernet. , vol.38 , pp. 5-108
- Korshunov, A.D.¹

11
- 34250958061
- Über die Zerlegung von Dreieckspolyedern in Tetraeder
- E. Schönhardt, Über die Zerlegung von Dreieckspolyedern in Tetraeder, Math. Ann. 98 (1928) 309-312.
- (1928) Math. Ann. , vol.98 , pp. 309-312
- Schönhardt, E.¹

12
- 0001175936
- The upper-bound conjecture and Cohen-Macaulay rings
- R. Stanley, The upper-bound conjecture and Cohen-Macaulay rings, Stud. Appl. Math. 54 (1975) 135-142.
- (1975) Stud. Appl. Math. , vol.54 , pp. 135-142
- Stanley, R.¹

13
- 85033114468
- Personal communications
- R. Živaljević, New cases of the colored Tverberg's theorem, Personal communications.
- New Cases of the Colored Tverberg's Theorem
- Živaljević, R.¹

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