On the contact dimensions of graphs-Reference-Cited by-同舟云学术

On the contact dimensions of graphs

Published:1988-03 Issue:1 Volume:3 Page:89-96
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Frankl P.,Maehara H.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02187899.pdf

Reference6 articles.

1. N. Alon, Explicit construction of exponeitial-sized families ofk-independent sets,Discrete Math. 58 (1986), 191–193.

2. P. Erdös and Z. Füredi, The greatest angle amongn points in thed-dimensional euclidean space,Ann. Discrete Math. 17 (1983), 275–283.

3. J. Friedman, ConstructingO(n logn) size monotone formula for thekth elementary symmetric polynomial ofn Boolean variables,Proceedings of the 25th IEEE Symposium on Foundations of Computer Science, 506–515, 1984.

4. H. Maehara, Contact patterns of equal nonoverlapping spheres,Graphs Combin. 1 (1985), 271–282.

5. R. A. Rankin, The closest packing of spherical caps inn-dimensions,Proc. Glasgow Math. Assoc. 2 (1955) 139–144.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic;Combinatorica;2020-04-28

2. Inapproximability of Clustering in Lp Metrics;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11

3. On the Complexity of Closest Pair via Polar-Pair of Point-Sets;SIAM Journal on Discrete Mathematics;2019-01

4. The geometry of graphs and some of its algorithmic applications;Combinatorica;1995-06

5. Recent Developments in Combinatorial Geometry;Algorithms and Combinatorics;1993