Related papers: On intersection of simply connected sets in the pl…
In this paper, we construct a compact subset of the real plane whose path-connectedness equivalence relation is Borel bireducible to a nonsmooth hyperfinite Borel equivalence relation. This answers a question of \cite{bec98}.
We show that 4-connected plane triangulations can be redrawn such that edges are represented by straight segments and the vertices are covered by a set of at most $\sqrt{2n}$ lines each of them horizontal or vertical. The same holds for all…
A variety is rationally connected if two general points can be joined by a rational curve. A higher version of this notion is rational simple connectedness, which requires suitable spaces of rational curves through two points to be…
For an even set of points in the plane, choose a max-sum matching, that is, a perfect matching maximizing the sum of Euclidean distances of its edges. For each edge of the max-sum matching, consider the ellipse with foci at the edge's…
A long standing conjecture of Richter and Thomassen states that the total number of intersection points between any $n$ simple closed Jordan curves in the plane, so that any pair of them intersect and no three curves pass through the same…
We give a new simple geometric proof that any seven points in the plane have four Tverberg partitions into three sets. This is the only confirmed non-trivial case of Sierksma's conjecture. Earlier proofs, by Stephan Hell, relied on…
This paper considers the task of connecting points on a piece of paper by drawing a curve between each pair of them. Under mild assumptions, we prove that many pairwise disjoint curves are unavoidable if either of the following rules is…
Two plane analytic branches are topologically equivalent if and only if they have the same multiplicity sequence. We show that having same semigroup is equivalent to having same multiplicity sequence, we calculate the semigroup from a…
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…
We prove that for any set $F$ of $n\ge 2$ pairwise disjoint open convex sets in $\mathbb{R}^3$, the connected components of the set of lines intersecting every member of $F$ are contractible. The same result holds for directed lines.
A {\em string graph} is the intersection graph of a family of continuous arcs in the plane. The intersection graph of a family of plane convex sets is a string graph, but not all string graphs can be obtained in this way. We prove the…
In the papers from Chui and Parnes (1971) and Luh (1972), as well on the paper from V.Nestoridis (1996) on the Universal Taylor series, it is used, without proof, that the union of two compact sets in $\mathbb{R} ^2$ with connected…
Deciding whether a family of disjoint line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.
This note is devoted to a trick which yields almost trivial proofs that certain complexes associated to topological surfaces are connected or simply connected. Applications include new proofs that the complexes of curves, separating curves,…
It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…
Consider a connected graph $G$ and let $T$ be a spanning tree of $G$. Every edge $e \in G-T$ induces a cycle in $T \cup \{e\}$. The intersection of two distinct such cycles is the set of edges of $T$ that belong to both cycles. We consider…
We prove the existence of non-trivial phase transitions for the intersection of two independent random interlacements and the complement of the intersection. Some asymptotic results about the phase curves are also obtained. Moreover, we…
We study intersections of projective convex sets in the sense of Steinitz. In a projective space, an intersection of a nonempty family of convex sets splits into multiple connected components each of which is a convex set. Hence, such an…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…