1-factorizations of complete multigraphs arising from finite geometry

DOI10.1006/jcta.2000.3115zbMath1071.51500DBLPjournals/jct/KorchmarosSS01OpenAlexW1977219226WikidataQ59249249 ScholiaQ59249249MaRDI QIDQ5930030

Angelo Sonnino, Alessandro Siciliano, Gábor Korchmáros

Publication date: 2001

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.2000.3115

Mathematics Subject Classification ID

Finite affine and projective planes (geometric aspects) (51E15) Blocking sets, ovals, (k)-arcs (51E21) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

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 ⋮ Blocking sets of certain line sets related to a conic ⋮ One-factorisations of complete graphs constructed in Desarguesian planes of certain odd square orders ⋮ On circular--linear one-factorizations of the complete graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Indecomposable factorizations of multigraphs
• A characterization of exterior lines of certain sets of points in PG(2,q)
• Constructing indecomposable 1-factorizations of the complete multigraph
• Sets in a finite plane with few intersection numbers and a distinguished point
• Baer subplanes and blocking sets
• Ovals In a Finite Projective Plane

This page was built for publication: 1-factorizations of complete multigraphs arising from finite geometry