Have a personal or library account? Click to login

Motzkin’s Maximal Density and Related Chromatic Numbers

Uniform distribution theory
Volume 13 (2018): Issue 1 (June 2018)
By:
Open Access
|Jul 2018

References

  1. [1] CANTOR, D. G.—GORDON, B.: Sequences of integers with missing differences, J. Combin. Theory Ser. A 14 (1973), 281–287.10.1016/0097-3165(73)90003-4
    Search in Google ScholarBack to article
  2. [2] CHANG, G.–LIU, D. D.-F.—ZHU, X.: Distance graphs and T -colorings, J. Combin. Theory Ser. B 75 (1999), 159–169.10.1006/jctb.1998.1881
    Search in Google ScholarBack to article
  3. [3] CIPU, M.—LUCA, F.: On the Galois group of the generalized Fibonacci polynomial, An. Ştiinţ. Univ. Ovidius Constanţa Ser. Mat. 9 (2001), 27–38.
    Search in Google ScholarBack to article
  4. [4] COLLISTER, D.—LIU, D. D.-F.: Study of κ(D) for D = {2, 3,x,y}, IWOCA (2014), 250–261.10.1007/978-3-319-19315-1_22
    Search in Google ScholarBack to article
  5. [5] GRIGGS, J. R.—LIU, D. D.-F.:, The channel assignment problem for mutually adjacent sites, J. Combin. Theory Ser. A 68 (1994), 169–183.10.1016/0097-3165(94)90096-5
    Search in Google ScholarBack to article
  6. [6] GUPTA, S.—TRIPATHI, A.: Density of M-sets in arithmetic progression Acta Arith. 89 (1999), 255–257.
    Search in Google ScholarBack to article
  7. [7] HARALAMBIS, N. M.: Sets of integers with missing differences, J. Combin. Theory Ser. A 23 (1977), 22–33.10.1016/0097-3165(77)90076-0
    Search in Google ScholarBack to article
  8. [8] LIU, D. D.-F.—ZHU, X.: Fractional chromatic number for distance graphs with large clique size, J. Graph Theory 47 (2004), 129–146.10.1002/jgt.20020
    Search in Google ScholarBack to article
  9. [9] LIU, D. D.-F.—ZHU, X.: Fractional chromatic number of distance graphs generated by two-interval sets, European J. Combin. 29 (7) (2008), 1733–1742.10.1016/j.ejc.2007.09.007
    Search in Google ScholarBack to article
  10. [10] MILES, E. P., JR.: Generalized Fibonacci numbers and associated matrices, Amer. Math. Monthly 67 (1960), 745–752.10.1080/00029890.1960.11989593
    Search in Google ScholarBack to article
  11. [11] PANDEY, R. K.—TRIPATHI, A.: A note on the density of M-sets in geometric sequence, Ars Comb. CXIX (2015), 221–224.
    Search in Google ScholarBack to article
  12. [12] PANDEY, R. K.—TRIPATHI, A.: A note on a problem of Motzkin regarding density of integral sets with missing differences, J. Integer Sequences 14 (2011).
    Search in Google ScholarBack to article
  13. [13] PANDEY, R. K.—TRIPATHI, A.: On the density of integral sets with missing differences from sets related to arithmetic progressions J. Number Theory 131 (2011), 634–647.
    Search in Google ScholarBack to article
  14. [14] WOLFRAM, D. A.: Solving generalized Fibonacci recurrences, Fibonacci Quart. 36 (1998), 129–145.
    Search in Google ScholarBack to article
  15. [15] ZHU, X.: Circular chromatic number: A survey, Disc. Math. 229 (2001), 371–410.10.1016/S0012-365X(00)00217-X
    Search in Google ScholarBack to article
DOI: https://doi.org/10.1515/udt-2018-0002 | Journal eISSN: 2309-5377 | Journal ISSN: 1336-913X
Journal RSS Feed
Language: English
Page range: 27 - 45
Submitted on: Nov 10, 2016
Accepted on: Mar 23, 2017
Published on: Jul 20, 2018
Published by: Slovak Academy of Sciences, Mathematical Institute
In partnership with: Paradigm Publishing Services
Publication frequency: 2 times per year
Keywords:
maximal density,
generalized Fibonacci numbers,
fractional coloring,
circular coloring
Related subjects:
Mathematics,
Algebra and number theory,
Discrete mathematics,
Probability and statistics,
Numerical and computational mathematics

© 2018 Anshika Srivastava, Ram Krishna Pandey, Om Prakash, published by Slovak Academy of Sciences, Mathematical Institute
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous articleVolume 13 (2018): Issue 1 (June 2018)Next article