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

메뉴 건너뛰기

Discrete & Computational Geometry

Volumn 12, Issue 1, 1994, Pages 1-7

Some geometric applications of Dilworth's theorem

(2) Pach, J a,b Torocsik J a

a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS (Hungary)

b CITY COLLEGE OF NEW YORK (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 51249163054 PISSN: 01795376 EISSN: 14320444 Source Type: Journal
DOI: 10.1007/BF02574361 Document Type: Article

Times cited : (55)

References (16)

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

2
- 0040678070
- Disjoint edges in geometric graphs
- (1989) Discrete Comput. Geom. , vol.4 , pp. 287-290
- Alon, N.¹ Erdős, P.²

3
- 0037858343
- Graphs
- in Hebrew
- (1966) Gilyonot Lematematika , vol.3 , pp. 2-8
- Avital, S.¹ Hanani, H.²

4
- 0004116989
- MIT Press, Cambridge, MA, McGraw-Hill, New York
- (1990) Introduction to Algorithms
- Cormen¹ Leiserson² Rives, R.L.³

5
- 0001387789
- A decomposition theorem for partially ordered sets
- (1950) The Annals of Mathematics , vol.51 , pp. 161-166
- Dilworth, R.P.¹

6
- 84936670952
- G. Ding, P. Seymour, and P. Winkler: Bounding the vertex cover number of a hypergraph, Combinatorica, to appear.

7
- 0000314230
- On sets of distances of n points
- (1964) Amer. Math. Monthly , vol.53 , pp. 248-250
- Erdős, P.¹

8
- 0001086798
- A combinatorial problem in geometry
- (1935) Compositio Math. , vol.2 , pp. 464-470
- Erdős, P.¹ Szekeres, G.²

9
- 84936670947
- W. Goddard, M. Katchalski, and D. J. Kleitman: Forcing disjoint segments in the plane, Manuscript.

10
- 84936670948
- 2nd edn., Wiley, New York
- (1990) Rarnsey Theory
- Graham, R.L.¹ Rothschild, B.L.² Spencer, J.H.³

11
- 0001579842
- Covering and coloring problems for relatives of intervals
- (1985) Discrete Math. , vol.55 , pp. 167-180
- Gyárfás, A.¹ Lehel, J.²

12
- 0039000282
- Aufgabe No. 167
- (1934) Jahresber. Deutsch. Math.-Verein. , vol.43 , pp. 114
- Hopf, H.¹ Pannwitz, E.²

13
- 84936646734
- Aarhus University Lecture Notes Series, No. 53, Aarhus University, Denmark
- (1979) Extremal Problems in Combinatorial Geometry
- Kyoutz, Y.S.¹

14
- 84936670949
- D. Larman, J. Matoušek, J. Pach, and J. Yörőcsik: A Ramsey-type result for planar convex sets, to appear.

15
- 1542605996
- Rutgers University, New Brunswick
- (1991) Every geometric graph with n vertices and 3.6 n+3.4 edges contains three pairwise disjoint edges
- O’Donnel, P.¹ Perles, M.²

16
- 84960601644
- On a problem of formal logic
- (1930) Proc. London Math. Soc. , vol.30 , pp. 264-286
- Raey, F.P.¹

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