New Results on Edge Rotation Distance Graphs

Author(s):  
Medha Itagi Huilgol ◽  
Chitra Ramprakash
Keyword(s):  
2021 ◽  
Vol 298 ◽  
pp. 143-154
Author(s):  
Boštjan Brešar ◽  
Jasmina Ferme ◽  
Karolína Kamenická
Keyword(s):  

2021 ◽  
Vol 71 (3) ◽  
pp. 595-614
Author(s):  
Ram Krishna Pandey ◽  
Neha Rai

Abstract For a given set M of positive integers, a well-known problem of Motzkin asks to determine the maximal asymptotic density of M-sets, denoted by μ(M), where an M-set is a set of non-negative integers in which no two elements differ by an element in M. In 1973, Cantor and Gordon find μ(M) for |M| ≤ 2. Partial results are known in the case |M| ≥ 3 including some results in the case when M is an infinite set. Motivated by some 3 and 4-element families already discussed by Liu and Zhu in 2004, we study μ(M) for two families namely, M = {a, b,a + b, n(a + b)} and M = {a, b, b − a, n(b − a)}. For both of these families, we find some exact values and some bounds on μ(M). This number theory problem is also related to various types of coloring problems of the distance graphs generated by M. So, as an application, we also study these coloring parameters associated with these families.


2015 ◽  
Vol 51 (2) ◽  
pp. 165-176 ◽  
Author(s):  
A. V. Bobu ◽  
O. A. Kostina ◽  
A. E. Kupriyanov

2019 ◽  
Vol 134 ◽  
pp. 143-163 ◽  
Author(s):  
Jan van den Heuvel ◽  
H.A. Kierstead ◽  
Daniel A. Quiroz

2021 ◽  
Vol 57 (2) ◽  
pp. 136-142
Author(s):  
A. V. Berdnikov ◽  
A.M. Raigorodskii
Keyword(s):  

2001 ◽  
Vol 233 (1-3) ◽  
pp. 239-246 ◽  
Author(s):  
Arnfried Kemnitz ◽  
Massimiliano Marangio

2012 ◽  
Vol 25 (4) ◽  
pp. 680-693 ◽  
Author(s):  
Daphne Der-Fen Liu ◽  
Aileen Sutedja

Sign in / Sign up

Export Citation Format

Share Document