One-factorizations of complete multigraphs arising from maximal \((k;n)\)-arcs in PG\((2,2^h)\)

DOI10.1016/S0012-365X(00)00337-XzbMath0979.05091OpenAlexW2029603947WikidataQ114122969 ScholiaQ114122969MaRDI QIDQ5937608

Angelo Sonnino

Publication date: 12 July 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00337-x

zbMATH Keywords

multigrapharchyperovalone-factorizations

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

One‐factorizations of complete multigraphs and quadrics in PG(n,q) ⋮ One-factorisations of complete graphs arising from ovals in finite planes ⋮ One-factorisations of complete graphs arising from hyperbolae in the Desarguesian affine plane ⋮ Indecomposable 1‐factorizations of the complete multigraph for every ⋮ One-factorisations of complete graphs constructed in Desarguesian planes of certain odd square orders ⋮ On circular--linear one-factorizations of the complete graph

This page was built for publication: One-factorizations of complete multigraphs arising from maximal \((k;n)\)-arcs in PG\((2,2^h)\)