On large distances in planar sets
نویسندگان
چکیده
منابع مشابه
On large distances in planar sets
Let n k denote the number of times the kth largest distance occurs among a set S of n points in the Euclidean plane. We prove that n2 ~< 2~n for arbitrary set S. This upper bound is sharp. We consider the set S of n arbitrary points in R 2. We denote the largest distance between two points in S by dl, the second largest by d2. Let us denote by nl resp. n2 the number of distances equal to dl res...
متن کاملLarge-volume open sets in normed spaces without integral distances
We study open sets P in normed spaces X attaining a large volume while avoiding pairs of points at integral distance. The proposed task is to find sharp inequalities for the maximum possible d-dimensional volume. This problem can be viewed as an opposite to known problems on point sets with pairwise integral or rational distances.
متن کاملPlanar digraphs without large acyclic sets
Given a directed graph, an acyclic set is a set of vertices inducing a directed subgraph with no directed cycle. In this note we show that for all integers n ≥ g ≥ 3, there exist oriented planar graphs of order n and digirth g for which the size of the maximum acyclic set is at most dn(g−2)+1 g−1 e. When g = 3 this result disproves a conjecture of Harutyunyan and shows that a question of Albert...
متن کاملDistances Sets That Are a Shift of the Integers and Fourier Basis for Planar Convex Sets
The aim of this paper is to prove that if a planar set A has a difference set ∆(A) satisfying ∆(A) ⊂ Z + s for suitable s than A has at most 3 elements. This result is motivated by the conjecture that the disk has not more than 3 orthogonal exponentials. Further, we prove that if A is a set of exponentials mutually orthogonal with respect to any symmetric convex set K in the plane with a smooth...
متن کاملLarge Independent Sets in Triangle-Free Planar Graphs
Every triangle-free planar graph on n vertices has an independent set of size at least (n+ 1)/3, and this lower bound is tight. We give an algorithm that, given a triangle-free planar graph G on n vertices and an integer k ≥ 0, decides whether G has an independent set of size at least (n+ k)/3, in time 2 √ n. Thus, the problem is fixed-parameter tractable when parameterized by k. Furthermore, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1987
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90027-6