Ramsey-type results for geometric graphs. II

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Ramsey-type results for geometric graphs. II

Full text

Pdf (1.20 MB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the thirteenth annual symposium on Computational geometry table of contents

Nice, France

Pages: 94 - 103

Year of Publication: 1997

ISBN:0-89791-878-9

Authors

Gyula Károlyi	Eötvös University, Budapest and ETH Zürich
János Pach	City College, CUNY and Courant Institute, NYU
Géza Tóth	Courant Institute, NYU
Pavel Valtr	Charles University, Prague and DIMACS Center, Rutgers University

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 16, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/262839.262908 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	B74	S.A. Burr, Generalized Ramsey theory for graphs - a survey, in: Graphs and Combinatorics (R. Bari and F. Harary, eds.), Lecture Notes in Mathematics 406, Springer-Verlag, Berlin, 1974, 52-75.
	BES75	S.A. Burr, P. Erd6s, and J.H. Spencer, Ramsey theorems for multiple copies of graphs, Transactions of the American Mathematical Society 209 (1975), 87-99.
	D50	R.P. Dilworth, A decomposition theorem for partially ordered sets, Annals of Mathematics 51 (1950), 161-166.
	ELSS73	P. ErdSs, L. Lov#z, A. Simmons, and E.G. Straus, Dissection graphs of planar point sets, in: A Survey of Combinatorial Theory (G. Srivastava, ed.), North-Holland, Amsterdam, 1973, 139-149.
	GMPP91	P. Gritzmann, B. Mohar, J. Pach, and R. Pollack, Embedding a planar triangulation with vertices at specified points (solution to problem E3341), American Mathematical Monthly 98 (1991), 165-166.
	GRS90	Ronald L. Graham , Bruce L. Rothschild, Ramsey theory (2nd ed.), Wiley-Interscience, New York, NY, 1990
	HS92	John Hershberger , Subhash Suri, Applications of a semi-dynamic convex hull algorithm, BIT, v.32 n.2, p.249-267, 1992 [doi>10.1007/BF01994880]
	KPT96	Gyula Károlyi , János Pach , Géza Tóth, Ramsey-type results for geometric graphs, Proceedings of the twelfth annual symposium on Computational geometry, p.359-365, May 24-26, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/237218.237405]
	KPTT97	Gy. K~rolyi, J. Pach, G. Tardos, and G. T6th, An algorithm for finding many disjoint monochromatic edges in a complete 2-colored geometric graph, in: Intuitive Geometry, (I. Bdrdny, K. BSrb'czky, eds.), Bolyai Soc. Math. Studies 6, to appear.
	PA95	J. Pach and P.K. Agarwal, Combinatorial Geometry, John Wiley, New York, 1995.