Applications of Graph and Hypergraph Theory in Geometry

The aim of this survey is to collect and explain some geometric results whose proof uses graph or hypergraph theory. No attempt has been made to give a complete list of such results. We rather focus on typical and recent examples showing the power and limitations of the method. The topics covered include forbidden configurations, geometric constructions, saturated hypergraphs in geometry, independent sets in graphs, the regularity lemma, and VC-dimension.

[1]  Micha Sharir,et al.  Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes , 1986, FOCS.

[2]  E. Szemerédi,et al.  A Lower Bound for Heilbronn'S Problem , 1982 .

[3]  Endre Szemerédi,et al.  A Combinatorial Distinction Between the Euclidean and Projective Planes , 1983, Eur. J. Comb..

[4]  L. A S Z L,et al.  Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997 .

[5]  P. Erdös.  On Sets of Distances of n Points , 1946 .

[6]  Jiří Matoušek,et al.  A fractional Helly theorem for convex lattice sets , 2003 .

[7]  I. Bárány.  LECTURES ON DISCRETE GEOMETRY (Graduate Texts in Mathematics 212) , 2003 .

[8]  M. Katchalski,et al.  A Problem of Geometry in R n , 1979 .

[9]  V. Sós,et al.  On a problem of K. Zarankiewicz , 1954 .

[10]  Pavel Valtr,et al.  A Positive Fraction Erdos - Szekeres Theorem , 1998, Discret. Comput. Geom..

[11]  Emo Welzl,et al.  Partition trees for triangle counting and other range searching problems , 1988, SCG '88.

[12]  János Komlós,et al.  A Dense Infinite Sidon Sequence , 1981, Eur. J. Comb..

[13]  Van H. Vu,et al.  Small Complete Arcs in Projective Planes , 2003, Comb..

[14]  L. Moser,et al.  AN EXTREMAL PROBLEM IN GRAPH THEORY , 2001 .

[15]  Noga Alon,et al.  Transversal numbers for hypergraphs arising in geometry , 2002, Adv. Appl. Math..

[16]  Jean-Paul Doignon,et al.  Convexity in cristallographical lattices , 1973 .

[17]  M. Katchalski,et al.  A problem of geometry in ⁿ , 1979 .

[18]  James B. Shearer,et al.  A note on the independence number of triangle-free graphs , 1983, Discret. Math..

[19]  Bernard Chazelle,et al.  The Discrepancy Method , 1998, ISAAC.

[20]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[21]  Peter Frankl,et al.  Intersection theorems with geometric consequences , 1981, Comb..

[22]  G. Kalai,et al.  Guarding galleries where every point sees a large area , 1997 .

[23]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[24]  J. Kahn,et al.  A counterexample to Borsuk's conjecture , 1993, math/9307229.

[25]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[26]  János Komlós,et al.  A Note on Ramsey Numbers , 1980, J. Comb. Theory, Ser. A.

[27]  J. Pach,et al.  Discrete Convex Functions and Proof of the Six Circle Conjecture of Fejes Tóth , 1984, Canadian Journal of Mathematics.

[28]  P. Erdös.  On an extremal problem in graph theory , 1970 .

[29]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[30]  Jeong Hyun Kang,et al.  Combinatorial Geometry , 2006 .

[31]  L. A. Oa,et al.  Crossing Numbers and Hard Erd} os Problems in Discrete Geometry , 1997 .

[32]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[33]  János Pach.  A Tverberg-type result on multicolored simplices , 1998, Comput. Geom..

[34]  Sinisa T. Vrecica,et al.  The Colored Tverberg's Problem and Complexes of Injective Functions , 1992, J. Comb. Theory, Ser. A.

[35]  Miklós Simonovits,et al.  Supersaturated graphs and hypergraphs , 1983, Comb..

[36]  T Szönyi,et al.  Surveys in Combinatorics, 1997: Some Applications of Algebraic Curves in Finite Geometry and Combinatorics , 1997 .

[37]  Tamas Hausel.  On a Gallai-type problem for lattices , 1995 .

[38]  Noga Alon,et al.  Point Selections and Weak ε-Nets for Convex Hulls , 1992, Combinatorics, Probability and Computing.

[39]  P. Erdös.  ON SEQUENCES OF INTEGERS NO ONE OF WHICH DIVIDES THE PRODUCT OF TWO OTHERS AND ON SOME RELATED PROBLEMS , 2004 .

[40]  P. Erdös,et al.  The Greatest Angle Among n Points in the d- Dimensional Euclidean Space , 1983 .

[41]  Jeong Han Kim,et al.  The Ramsey Number R(3, t) Has Order of Magnitude t2/log t , 1995, Random Struct. Algorithms.

[42]  C. Rogers,et al.  The realization of distances within sets in Euclidean space , 1972 .

[43]  N. Alon,et al.  Piercing convex sets and the hadwiger-debrunner (p , 1992 .

[44]  P. Valtr.  Guarding galleries where no point sees a small area , 1998 .

[45]  H. Scarf.  An observation on the structure of production sets with indivisibilities. , 1977, Proceedings of the National Academy of Sciences of the United States of America.

[46]  G. Szekeres,et al.  A combinatorial problem in geometry , 2009 .

[47]  Zoltán Füredi,et al.  On the number of halving planes , 1989, SCG '89.