# About an Erdős–Grünbaum Conjecture Concerning Piercing of Non-bounded Convex Sets

@article{Montejano2015AboutAE, title={About an Erdős–Gr{\"u}nbaum Conjecture Concerning Piercing of Non-bounded Convex Sets}, author={Amanda Montejano and Luis Pedro Montejano and Edgardo Rold{\'a}n-Pensado and Pablo Sober{\'o}n}, journal={Discrete \& Computational Geometry}, year={2015}, volume={53}, pages={941-950} }

In this paper, we study the number of compact sets needed in an infinite family of convex sets with a local intersection structure to imply a bound on its piercing number, answering a conjecture of Erdős and Grünbaum. Namely, if in an infinite family of convex sets in $$\mathbb {R}^d$$Rd we know that out of every $$p$$p there are $$q$$q which are intersecting, we determine if having some compact sets implies a bound on the number of points needed to intersect the whole family. We also study…

## References

SHOWING 1-10 OF 25 REFERENCES

A counterexample to a conjecture of Grünbaum on piercing convex sets in the plane

- MathematicsDiscret. Math.
- 2013

The Maximum Piercing Number for some Classes of Convex Sets with the (4, 3)-property

- MathematicsElectron. J. Comb.
- 2008

It is proved that the maximum possible piercing number of a finite collection of closed convex sets in the plane with $(4,3)$-property is $2 for the collections of segments and $3 for the collection of the other two types.

Minimum number of elements representing a set system of given rank

- MathematicsJ. Comb. Theory, Ser. A
- 1989

Convex Sets in the Plane with Three of Every Four Meeting

- MathematicsComb.
- 2001

It is shown that 13 points are sufficient to meet every one of the convex sets of a finite collection of closed convex set in the plane.

Tolerance in Helly-Type Theorems

- MathematicsDiscret. Comput. Geom.
- 2011

It is proved, using the Erdős–Gallai theorem, that any Helly-type theorem can be generalized by relaxing the assumptions and conclusion, allowing a bounded number of exceptional sets or points.

Graphs of Morphisms of Graphs

- MathematicsElectron. J. Comb.
- 2008

A picture of the elements of an undirected graph, as involving two types of edges with a single vertex, namely 'bands' and 'loops', is emphasised, which is an account for the combinatorially minded reader of various categories of directed and Undirected graphs, and their analogies with the category of sets.

Geometric Etudes in Combinatorial Mathematics

- Mathematics
- 1991

-Forewords to the Second Edition.-Forewords to the First Edition.-Preface to the Second Edition.-Preface to the First Edition.-Part I. Original Etudes.-1. Tiling a Checker Rectangle.- 1.1…

The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators

- Mathematics
- 2008

Merry-Go-Round.- A Story of Colored Polygons and Arithmetic Progressions.- Colored Plane.- Chromatic Number of the Plane: The Problem.- Chromatic Number of the Plane: An Historical Essay.-…

A Survey of the Hadwiger-Debrunner (p, q)-problem

- Mathematics
- 2003

At the annual meeting of the Swiss Mathematical Society held in September 1956 in Basel, H. Hadwiger presented the following theorem. It was published one year later in a joint paper with H.…