There Are Not Too Many Magic Configurations-Reference-Cited by-同舟云学术

There Are Not Too Many Magic Configurations

Published:2007-09-19 Issue:1-3 Volume:39 Page:3-16
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Ackerman Eyal,Buchin Kevin,Knauer Christian,Pinchasi Rom,Rote Günter

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/s00454-007-9023-0.pdf

Reference10 articles.

1. Csima, J., Sawyer, E.T.: There exist 6n/13 ordinary points. Discrete Comput. Geom. 9(1), 187–202 (1993)

2. Demaine, E., Mitchell, J.S.B., O’Rourke, J.: Problem 65: Magic configurations. The Open Problems Project, http://maven.smith.edu/~orourke/TOPP/P65.html

3. Advanced Lectures in Mathematics;S. Felsner,2004

4. Gallai, T.: Solution of problem 4065. Am. Math. Mon. 51, 169–171 (1944)

5. Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics;B. Grünbaum,1972

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

1. On Sets of Points in General Position That Lie on a Cubic Curve in the Plane;Studia Scientiarum Mathematicarum Hungarica;2022-12-14

2. On Sets of n Points in General Position That Determine Lines That Can Be Pierced by n Points;Discrete & Computational Geometry;2020-04-24

3. Classification theorem for strong triangle blocking arrangements;Publications de l'Institut Math?matique (Belgrade);2020

4. A One-Page Solution of a Problem of Erdős and Purdy;Discrete & Computational Geometry;2019-10-16

5. On the affine Sylvester problem;Discrete Applied Mathematics;2011-04