Constructions for large sets of disjoint compatible packings on 6k+5 points

Autori

  • Jianguo Lei Hebei Teacher's University & Beijing Jiaotong University
  • Yanxun Chang Beijing Jiaotong University
  • Giovanni Lo Faro Università degli Studi di Messina
  • Antoinette Tripodi Università degli Studi di Messina

DOI:

https://doi.org/10.1478/C1A1002003

Abstract

In this paper, we give two methods to construct large sets of disjoint compatible packings (LMP(1vC4)) on 6k+5 points. As a result, we prove that there exists an (LMP(1vC4)) for v=7i uj where i ≥ 0, j ≥ 1 and u ∈ {13, 19, 25, 31, 43, 67, 139, 163, 211, 283, 307, 331, 379}.

Dowloads

Pubblicato

2010-09-17

Fascicolo

V. 88 N. 2 (2010)

Sezione

Articoli

Licenza

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors who publish with this journal agree to the following terms:
  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).