On Conway's thrackle conjecture

Discrete and Computational Geometry

Volumn 18, Issue 4, 1997, Pages 369-376

  Lovasz L ^a   Pach, J ^b   Szegedy, M ^c  

^a Yale University   (United States)

^b NEW YORK UNIVERSITY   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040645474     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009322     Document Type: Article

References (22)

1. L. Babai and P. Frankl, Linear Algebra Methods in Combinatorics, Part I, Technical Report, University of Chicago, 1988.
2. E. R. Berlekamp, On subsets with intersections of even cardinality, Canadian Mathematical Bulletin 12 (1969), 363-366.
3. N. G. de Bruijn and P. Erdös, On a combinatorial problem, Proc. Konink. Nederl. Akad. Wetensch., Ser. A 51 (1948), 1277-1279 (= Indagationes Mathematicae 10 (1948), 421-423).
4. N. G. de Bruijn and P. Erdös, On a combinatorial problem, Proc. Konink. Nederl. Akad. Wetensch., Ser. A 51 (1948), 1277-1279 (= Indagationes Mathematicae 10 (1948), 421-423).
5. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Algorithms for drawing graphs: An annotated bibliography, Computational Geometry: Theory & Applications 4 (1994), 235-282.
6. W. Fenchel and J. Sutherland, Lösung der Aufgabe 167, Jahresbericht der Deutschen Mathematiker-Vereinigung 45 (1935), 33-35.
7. M. R. Garey and D. S. Johnson, Crossing number is N P-complete, SIAM Journal of Algebraic Discrete Methods 4 (1983), 312-316.
8. R. L. Graham, The largest small hexagon, Journal of Combinatorial Theory 18 (1975), 165-170.
9. J. Green-Cottingham, Thrackles, Surfaces and Drawings of Graphs, Doctoral Dissertation, Clemson University, 1993.
10. R. K. Guy, Crossing numbers of graphs, In: Graph Theory and Applications, Lecture Notes in Mathematics, Vol. 303, Springer-Verlag, Berlin, 1972, pp. 111-124.
11. H. Hopf and E. Pannwitz, Aufgabe Nr. 167, Jahresbericht der Deutschen Mathematiker-Vereinigung 43 (1934), 114.
12. T. Kövári, V. T. Sös, and P. Turán, On a problem of K. Zarankiewicz, Colloqium Mathematicum 3 (1954), 50-57.
13. J. A. de Loera, B. Sturmfels, and R. R. Thomas, Gröbner bases and triangulations of the second hypersimplex, Combinatorica, to appear.
14. J. Pach and P. K. Agarwal, Combinatorial Geometry, Wiley, New York, 1995.
15. B. Piazza, R. Ringeisen, and S. Stueckle, On Conway's reduction of the thrackle conjecture and some associated drawings, to appear.
16. B. Piazza, R. Ringeisen, and S. Stueckle, Properties of non-minimum crossings for some classes of graphs, In: Graph Theory, Combinatorics, and Applications, Vol. 2 (Y. Alavi et al., eds.), Wiley, New York, 1991, pp. 975-989.
17. R. Ringeisen, S. Stueckle, and B. Piazza, Subgraphs and bounds on maximum crossings, Bulletin ICA 2 (1991), 33-46.
18. P. Turán, A note of welcome, Journal of Graph Theory 1 (1977), 7-9.
19. W. T. Tutte, Toward a theory of crossing number, Journal of Combinatorial Theory 8 (1970), 45-53.
20. A. T. White and L. W. Beineke, Topological graph theory, In: Selected Topics in Graph Theory (L. Beineke and R. Wilson, eds.), Academic Press, London, 1978, pp. 15-49.
21. D. R. Woodall, Thrackles and deadlock, In: Combinatorial Mathematics and Its Applications (D. J. A. Welsh, ed.), Academic Press, London, 1969, pp. 335-348.
22. D. R. Woodall, Open problems, In: Combinatorics, Proceedings of the Conference on Combinatorial Mathematics (D. J. A. Welsh and D. R. Woodall, eds.), Institute of Mathematics and Its Applications, Southend-on-Sea, Essex, 1972, pp. 341-350.