Transversal numbers for hypergraphs arising in geometry
From MaRDI portal
Publication:1865252
DOI10.1016/S0196-8858(02)00003-9zbMath1027.52003WikidataQ105333976 ScholiaQ105333976MaRDI QIDQ1865252
Noga Alon, Gil Kalai, Ji{ří} Matoušek, Roy Meshulam
Publication date: 26 March 2003
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Related Items
Transversal numbers over subsets of linear spaces, A note on the colorful fractional Helly theorem, Intersections of Leray complexes and regularity of monomial ideals, Helly-type theorems for the diameter, Improved bounds on the Hadwiger-Debrunner numbers, Helly-gap of a graph and vertex eccentricities, Radon numbers grow linearly, Combinatorial properties of nonarchimedean convex sets, Results on the regularity of square-free monomial ideals, From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem, Further consequences of the colorful Helly hypothesis, Attempting perfect hypergraphs, Fractional Helly theorem for Cartesian products of convex sets, Saturating sets in projective planes and hypergraph covers, Embeddings of \(k\)-complexes into \(2k\)-manifolds, Berge's theorem, fractional Helly, and art galleries, Unnamed Item, Helly’s theorem: New variations and applications, Nerves, minors, and piercing numbers, Helly numbers of acyclic families, On weak \(\epsilon\)-nets and the Radon number, Large cliques in hypergraphs with forbidden substructures, A non-linear lower bound for planar epsilon-nets, Lower bounds on Tuza constants for transversals in linear uniform hypergraphs, On transversal numbers of intersecting straight line systems and intersecting segment systems, Quantitative fractional Helly and \((p,q)\)-theorems, On transversal and 2-packing numbers in uniform linear systems, Lower bounds for weak epsilon-nets and stair-convexity, Non-representability of finite projective planes by convex sets, Radon numbers and the fractional Helly theorem, Unnamed Item, From a $(p,2)$-Theorem to a Tight $(p,q)$-Theorem, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Further Consequences of the Colorful Helly Hypothesis, Helly-type problems, A fractional Helly theorem for convex lattice sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- Intersection patterns of convex sets
- Über eine Variante zum Hellyschen Satz
- An upper-bound theorem for families of convex sets
- \(\epsilon\)-nets and simplex range queries
- Partition numbers for trees and ordered sets
- A generalization of Caratheodory's theorem
- Almost tight bounds for \(\epsilon\)-nets
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- d-collapsing and nerves of families of convex sets
- Bounding the vertex cover number of a hypergraph
- Improved bounds on weak \(\varepsilon\)-nets for convex sets
- On a Gallai-type problem for lattices
- Bounding the piercing number
- Convexity in cristallographical lattices
- A Problem of Geometry in R n
- On the Geometry and Computational Complexity of Radon Partitions in the Iinteger Lattice
- The Upper Bound Conjecture and Cohen-Macaulay Rings
- Point Selections and Weak ε-Nets for Convex Hulls
- Almost regular sequences and Betti numbers
