scholarly journals On the minimum size of a point set containing a 5-hole and a disjoint 4-hole

2011 ◽  
Vol 48 (4) ◽  
pp. 445-457 ◽  
Author(s):  
Bhaswar Bhattacharya ◽  
Sandip Das
Keyword(s):  
Upper Bound ◽  
Minimum Size ◽  
Convex Hulls ◽  
Type Result ◽  
Convex Polygons ◽  
Empty Convex ◽  
Ramsey Type ◽  
Point Set

Let H(k; l), k ≦ l denote the smallest integer such that any set of H(k; l) points in the plane, no three on a line, contains an empty convex k-gon and an empty convex l-gon, which are disjoint, that is, their convex hulls do not intersect. Hosono and Urabe [JCDCG, LNCS 3742, 117–122, 2004] proved that 12 ≦ H(4, 5) ≦ 14. Very recently, using a Ramseytype result for disjoint empty convex polygons proved by Aichholzer et al. [Graphs and Combinatorics, Vol. 23, 481–507, 2007], Hosono and Urabe [Kyoto CGGT, LNCS 4535, 90–100, 2008] improve the upper bound to 13. In this paper, with the help of the same Ramsey-type result, we prove that H(4; 5) = 12.

scholarly journals A Note on the Minimum Size of a Point Set Containing Three Nonintersecting Empty Convex Polygons

Symmetry ◽  
2018 ◽  
Vol 10 (10) ◽  
pp. 447
Author(s):  
Qing Yang ◽  
Zengtai You ◽  
Xinshang You
Keyword(s):  
Pairwise Disjoint ◽  
Convex Polygon ◽  
Minimum Size ◽  
Convex Polygons ◽  
Planar Point ◽  
Empty Convex ◽  
Point Set

Let P be a planar point set with no three points collinear, k points of P be a k-hole of P if the k points are the vertices of a convex polygon without points of P. This article proves 13 is the smallest integer such that any planar points set containing at least 13 points with no three points collinear, contains a 3-hole, a 4-hole and a 5-hole which are pairwise disjoint.

On the minimum cardinality of a planar point set containing two disjoint convex polygons

2013 ◽  
Vol 50 (3) ◽  
pp. 331-354
Author(s):  
Liping Wu ◽  
Wanbing Lu
Keyword(s):  
Positive Integer ◽  
Convex Hulls ◽  
Convex Polygons ◽  
Minimum Cardinality ◽  
Planar Point ◽  
Point Set ◽  
Disjoint Convex

Let N(k, l) be the smallest positive integer such that any set of N(k, l) points in the plane, no three collinear, contains both a convex k-gon and a convex l-gon with disjoint convex hulls. In this paper, we prove that N(3, 4) = 7, N(4, 4) = 9, N(3, 5) = 10 and N(4, 5) = 11.

scholarly journals On empty convex polygons in a planar point set

2006 ◽  
Vol 113 (3) ◽  
pp. 385-419 ◽  
Author(s):  
Rom Pinchasi ◽  
Radoš Radoičić ◽  
Micha Sharir
Keyword(s):  
Convex Polygons ◽  
Planar Point ◽  
Empty Convex ◽  
Point Set

A note on improved upper bounds on the transversal number of hypergraphs

2019 ◽  
Vol 11 (01) ◽  
pp. 1950004
Author(s):  
Michael A. Henning ◽  
Nader Jafari Rad
Keyword(s):  
Upper Bound ◽  
Dominating Set ◽  
Domination Number ◽  
Minimum Size ◽  
Total Domination ◽  
Total Domination Number ◽  
Minimum Cardinality ◽  
Total Dominating Set ◽  
Isolated Vertex ◽  
Transversal Number

A subset [Formula: see text] of vertices in a hypergraph [Formula: see text] is a transversal if [Formula: see text] has a nonempty intersection with every edge of [Formula: see text]. The transversal number of [Formula: see text] is the minimum size of a transversal in [Formula: see text]. A subset [Formula: see text] of vertices in a graph [Formula: see text] with no isolated vertex, is a total dominating set if every vertex of [Formula: see text] is adjacent to a vertex of [Formula: see text]. The minimum cardinality of a total dominating set in [Formula: see text] is the total domination number of [Formula: see text]. In this paper, we obtain a new (improved) probabilistic upper bound for the transversal number of a hypergraph, and a new (improved) probabilistic upper bound for the total domination number of a graph.

scholarly journals On Reay's Relaxed Tverberg Conjecture and Generalizations of Conway's Thrackle Conjecture

10.37236/6516 ◽  
2018 ◽  
Vol 25 (3) ◽  
Author(s):  
Megumi Asada ◽  
Ryan Chen ◽  
Florian Frick ◽  
Frederick Huang ◽  
Maxwell Polevy ◽  
...  
Keyword(s):  
Geometric Property ◽  
Convex Sets ◽  
Convex Hulls ◽  
Open Problems ◽  
Higher Dimensional ◽  
Special Cases ◽  
Minimum Number ◽  
Point Set ◽  
Colored Version ◽  
Special Case

Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean $d$-space that guarantees any such point set admits a partition into $r$ parts, any $k$ of whose convex hulls intersect. Here we give new and improved lower bounds for this number, which Reay conjectured to be independent of $k$. We prove a colored version of Reay's conjecture for $k$ sufficiently large, but nevertheless $k$ independent of dimension $d$. Pairwise intersecting convex hulls have severely restricted combinatorics. This is a higher-dimensional analogue of Conway's thrackle conjecture or its linear special case. We thus study convex-geometric and higher-dimensional analogues of the thrackle conjecture alongside Reay's problem and conjecture (and prove in two special cases) that the number of convex sets in the plane is bounded by the total number of vertices they involve whenever there exists a transversal set for their pairwise intersections. We thus isolate a geometric property that leads to bounds as in the thrackle conjecture. We also establish tight bounds for the number of facets of higher-dimensional analogues of linear thrackles and conjecture their continuous generalizations.

scholarly journals The Minimum Size of Signed Sumsets

10.37236/4881 ◽  
2015 ◽  
Vol 22 (2) ◽  
Author(s):  
Béla Bajnok ◽  
Ryan Matzke
Keyword(s):  
Abelian Group ◽  
Upper Bound ◽  
Finite Abelian Group ◽  
Minimum Size ◽  
Positive Integers

For a finite abelian group $G$ and positive integers $m$ and $h$, we let $$\rho(G, m, h) = \min \{ |hA| \; : \; A \subseteq G, |A|=m\}$$ and$$\rho_{\pm} (G, m, h) = \min \{ |h_{\pm} A| \; : \; A \subseteq G, |A|=m\},$$ where $hA$ and $h_{\pm} A$ denote the $h$-fold sumset and the $h$-fold signed sumset of $A$, respectively. The study of $\rho(G, m, h)$ has a 200-year-old history and is now known for all $G$, $m$, and $h$. Here we prove that $\rho_{\pm}(G, m, h)$ equals $\rho (G, m, h)$ when $G$ is cyclic, and establish an upper bound for $\rho_{\pm} (G, m, h)$ that we believe gives the exact value for all $G$, $m$, and $h$.

Sign in / Sign up

Export Citation Format

Share Document