DISTANCE GRAPHS AND SETS OF POSITIVE UPPER DENSITY IN Rd

被引：9

作者：

Lyall, Neil ^{[1
]}

Magyar, Akos ^{[1
]}

机构：

[1] Univ Georgia, Dept Math, Athens, GA 30602 USA

来源：

ANALYSIS & PDE | 2020年 / 13卷 / 03期

基金：

美国国家科学基金会;

关键词：

distance graphs; uniformity norms; geometric Ramsey theory; SUBSETS; THEOREM;

D O I：

10.2140/apde.2020.13.685

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We present a refinement and sharp extension of a result of Bourgain on finding configurations of k+1 points in general position in measurable subset of R-d of positive upper density whenever d >= k + 1 to all proper k-degenerate distance graphs.

引用

页码：685 / 700

页数：16

共 50 条

[21] Nilfactors of Rm-actions and configurations in sets of positive upper density in Rm
Ziegler, Tamar
JOURNAL D ANALYSE MATHEMATIQUE, 2006, 99 (1): : 249 - 266
[22] On representations of graphs as two-distance sets
Alfakih, A. Y.
DISCRETE MATHEMATICS, 2020, 343 (0I)
[23] Large sets of long distance equienergetic graphs
Stevanovic, Dragan
ARS MATHEMATICA CONTEMPORANEA, 2009, 2 (01) : 35 - 40
[24] Graphs and spherical two-distance sets
Musin, Oleg R.
EUROPEAN JOURNAL OF COMBINATORICS, 2019, 80 : 311 - 325
[25] ON PRODUCT OF DIFFERENCE SETS FOR SETS OF POSITIVE DENSITY
Fish, Alexander
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2018, 146 (08) : 3449 - 3453
[26] Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs
Liu, Zi-Long
Tian, Fang
Xu, Jun-Ming
THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3804 - 3813
[27] Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
LIESP, Université Claude Bernard LyonI, 843, Bd. Du 11 Novembre 1918, 69622 Villeurbanne Cedex, France
不详
Discrete Math. Theor. Comput. Sci., 2008, 1 (57-70):
[28] Upper bounds on sets of orthogonal colorings of graphs
Ballif, Serge C.
DISCRETE MATHEMATICS, 2013, 313 (20) : 2195 - 2205
[29] Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
Kheddouci, Hamamache
Togni, Olivier
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2008, 10 (01): : 57 - 70
[30] Upper bound for the number of independent sets in graphs
A. A. Sapozhenko
Doklady Mathematics, 2007, 75 : 447 - 448

← 1 2 3 4 5 →