Related papers: Greedy capsets
The size-Ramsey number of a graph $F$ is the smallest number of edges in a graph $G$ with the Ramsey property for $F$, that is, with the property that any 2-colouring of the edges of $G$ contains a monochromatic copy of $F$. We prove that…
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. The existence of greedy drawings has been…
A graph whose vertices are points in the plane and whose edges are noncrossing straight-line segments of unit length is called a \emph{matchstick graph}. We prove two somewhat counterintuitive results concerning the maximum number of edges…
Leveraging the wealth of unlabeled data produced in recent years provides great potential for improving supervised models. When the cost of acquiring labels is high, probabilistic active learning methods can be used to greedily select the…
For $h \geq 1$, a $B_h$-set is a set of integers such that every integer $n$ has at most one representation in the form $n = a_{i_1} + \cdots + a_{i_h}$, where $a_{i_j} \in A$ for all $j = 1,\ldots, h$ and $a_{i_1} \leq \ldots \leq…
A graph is a mathematical object consisting of a set of vertices and a set of edges connecting vertices. Graphs can be drawn on paper in various ways, but until recently all published methods of drawing graphs have had undesirable…
We prove that a closed convex subset $C$ of a complete linear metric space $X$ is polyhedral in its closed linear hull if and only if no infinite subset $A\subset X\backslash C$ can be hidden behind $C$ in the sense $[x,y]\cap C\not =…
With the increased availability of 3D scanning technology, point clouds are moving into the focus of computer vision as a rich representation of everyday scenes. However, they are hard to handle for machine learning algorithms due to their…
We construct a model in which the splitting number is large and every ultrafilter has a small subset with no pseudo-intersection.
A cut of a graph can be represented in many different ways. Here we propose to represent a cut through a ``relation tree'', which is a spanning tree with signed edges. We show that this picture helps to classify the main greedy heuristics…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
A meander of order n is a simple closed curve in the plane which intersects a horizontal line transversely at 2n points. (Meanders which differ by an isotopy of the line and plane are considered equivalent.) Let Gamma_n be the Cayley graph…
A biased graph is a graph $G$, together with a distinguished subset $\mathcal{B}$ of its cycles so that no Theta-subgraph of $G$ contains precisely two cycles in $\mathcal{B}$. A large number of biased graphs can be constructed by choosing…
Like simpler graphs, nested (hypernodal) graphs consist of two components: a set of nodes and a set of edges, where each edge connects a pair of nodes. In the hypernodal graph model, however, a node may contain other graphs, so that a node…
We study the problem of how to breakup many point sets in $\mathbb{R}^d$ into smaller parts using a few splitting (shared) hyperplanes. This problem is related to the classical Ham-Sandwich Theorem. We provide a logarithmic approximation to…
A set of points in $\mathbb{R}^d$ is acute, if any three points from this set form an acute angle. In this note we construct an acute set in $\mathbb{R}^d$ of size at least $2^{d/2}$.
Suppose that $A$ and $B$ are closed subsets of a Euclidean space such that $A\cap B\neq\varnothing$, and we aim to find a point in this intersection with the help of the sequences $(a_n)_\nnn$ and $(b_n)_\nnn$ generated by the \emph{method…
Answering a question of P. Erdos from 1965, we show that for every eps>0 there is a set A of n integers with the following property: every subset A' of A with at least (1/3 + eps)n elements contains three distinct elements x,y,z with x + y…
This paper gives some relating results for various concepts of convexity in metric spaces such as midpoint convexity, convex structure, uniform convexity and near-uniform convexity, Busemann curvature and its relation to convexity. Some…
We define a class of subsets of a topological space that coincides with the class of compact saturated subsets when the space is sober, and with enough good properties when the space is not sober. This class is introduced especially in view…