Transversal numbers for hypergraphs arising in geometry
暂无分享,去创建一个
Noga Alon | Jirí Matousek | Gil Kalai | Roy Meshulam | N. Alon | G. Kalai | R. Meshulam | J. Matoušek
[1] J. Herzog,et al. Almost regular sequences and Betti numbers , 2000 .
[2] Joseph O'Rourke,et al. Handbook of Discrete and Computational Geometry, Second Edition , 1997 .
[3] Robert E. Jamison-Waldner. PARTITION NUMBERS FOR TREES AND ORDERED SETS , 1981 .
[4] N. Alon,et al. Piercing convex sets and the hadwiger-debrunner (p , 1992 .
[5] Jürgen Eckhoff,et al. An Upper-Bound theorem for families of convex sets , 1985 .
[6] G. Wegner,et al. d-Collapsing and nerves of families of convex sets , 1975 .
[7] Jiří Matoušek,et al. A fractional Helly theorem for convex lattice sets , 2003 .
[8] Jean-Paul Doignon,et al. Convexity in cristallographical lattices , 1973 .
[9] Tamas Hausel. On a Gallai-type problem for lattices , 1995 .
[10] Leonidas J. Guibas,et al. Improved bounds on weak ε-nets for convex sets , 1993, STOC.
[11] László Lovász,et al. Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.
[12] Gil Kalai,et al. Intersection patterns of convex sets , 1984 .
[13] Rephael Wenger,et al. Helly-Type Theorems and Geometric Transversals , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[14] Paul Seymour,et al. Bounding the vertex cover number of a hypergraph , 1994, Comb..
[15] Noga Alon,et al. Bounding the piercing number , 1995, Discret. Comput. Geom..
[16] M. Katchalski,et al. A problem of geometry in ⁿ , 1979 .
[17] R. Stanley. The Upper Bound Conjecture and Cohen‐Macaulay Rings , 1975 .
[18] János Komlós,et al. Almost tight bounds forɛ-Nets , 1992, Discret. Comput. Geom..
[19] Noga Alon,et al. Point Selections and Weak ε-Nets for Convex Hulls , 1992, Combinatorics, Probability and Computing.
[20] David Haussler,et al. Epsilon-nets and simplex range queries , 1986, SCG '86.
[21] Jirí Matousek,et al. A Lower Bound for Weak ɛ -Nets in High Dimension , 2002, Discret. Comput. Geom..
[22] H. Edelsbrunner,et al. Improved bounds on weak ε-nets for convex sets , 1995, Discret. Comput. Geom..
[23] Shmuel Onn,et al. On the Geometry and Computational Complexity of Radon Partitions in the Integer Lattice , 1991, SIAM J. Discret. Math..
[24] Imre Bárány,et al. A generalization of carathéodory's theorem , 1982, Discret. Math..
[25] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[26] David Haussler,et al. ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..
[27] M. Katchalski,et al. A Problem of Geometry in R n , 1979 .
[28] H. Hadwiger,et al. Über eine Variante zum Hellyschen Satz , 1957 .