|
This article is available for purchase or by subscription. See below.
Abstract
|
|
Many recent results in combinatorics concern the relationship between the size of a set and
the number of distances determined by pairs of points in the set. One extension of this
question considers configurations within the set with a specified pattern of distances.
In this paper, we use graph-theoretic methods to prove that a sufficiently large set
must contain at least
distinct copies of any
given weighted tree
, where
is a constant depending
only on the graph
.
|
PDF Access Denied
We have not been able to recognize your IP address
3.238.111.130
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 40.00:
Keywords
finite point configurations, distance sets, graphs
|
Mathematical Subject Classification 2010
Primary: 52C10
|
Milestones
Received: 5 March 2018
Revised: 10 August 2018
Accepted: 8 September 2018
Published: 20 May 2019
|
|
