nach oben

Designs, Codes and Cryptography

Erschienen in:

01.12.2015

Almost \(2\)-perfect \(6\)-cycle systems

verfasst von: Charles C. Lindner, Mariusz Meszka, Alexander Rosa

Erschienen in: Designs, Codes and Cryptography | Ausgabe 2-3/2015

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

We prove that an almost \(2\)-perfect \(6\)-cycle system of order \(n\) exists if and only if \(n \equiv 1\) or \(9\ (mod\ 12)\), and that an almost \(2\)-perfect maximum packing with \(6\)-cycles of order \(n\) exists for all \(n \ge 6\).

Vorheriger Artikel On tight bounds for binary frameproof codes

Nächster Artikel Primitive normal bases for quartic and cubic extensions: a geometric approach

Alspach B., Gavlas H., Šajna M., Verrall H.: Cycle decompositions IV: complete directed graphs and fixed length directed cycles. J. Comb. Theory A 103, 165–208 (2003).

Bryant D.E., Lindner C.C.: 2-perfect m-cycle systems can be equationally defined for m = 3, 5, and 7 only. Algebr. Univ. 35, 1–7 (1996).

Colbourn C.J., Rosa A.: Triple Systems. Oxford University Press, Oxford (1999).

Lindner C.C.: Quasigroups constructed from cycle systems. Quasigroups Relat. Syst. 10, 29–64 (2003).

Lindner C.C., Rodger C.A.: 2-perfect m-cycle systems. Discret. Math. 104, 83–90 (1992).

Lindner C.C., Stinson D.R.: Steiner pentagon systems. Discret. Math. 52, 67–74 (1984).

Lindner C.C., Phelps K.T., Rodger C.A.: 2-perfect 6-cycle systems. J. Comb. Theory A 57, 76–85 (1991).

Mullin R.C., Gronau H.-D.O.F.: PBDs and GDDs: the basics. In: Handbook of Combinatorial Designs, 2nd edn., pp. 231–270. CRC Press, Boca Raton (2007).

Rosa A.: O cyklických rozkladoch kompletného grafu na nepárnouholníky. Čas. Pěst. Mat. 91, 53–63 (1966).

10.

Rosa A., Huang C.: Another class of balanced graph designs: balanced circuit designs. Discret. Math. 12, 269–293 (1975).

Titel: Almost -perfect -cycle systems
verfasst von: Charles C. Lindner
Mariusz Meszka
Alexander Rosa
Publikationsdatum: 01.12.2015
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 2-3/2015
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-015-0049-7

Springer Professional

Almost \(2\)-perfect \(6\)-cycle systems

Abstract

Premium Partner

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 2-3/2015

Some primality tests that eluded Lucas

Open problems in hash function security

Perfect hash families of strength three with three rows from varieties on finite projective geometries

Enumeration of Kerdock codes of length 64

Linearly homomorphic structure-preserving signatures and their applications

The asymptotic existence of DR-BIBDs

Premium Partner