Embedding 1-factorizations of K_n in PG(2,32)

DOI10.1007/S00373-012-1166-YMaRDI QIDQ354447zbMATH OpenOpenAlexWikidataFDO

Authors Giorgio Faina, Cristiano Parrettini, Fabio Pasticci

Publication date 19 July 2013

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0803.3933

zbMATH Keywords

1-factorizationsGalois planeshyperfocused arcs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: In PG(2,32) the following two results are proven by a computer aided search. (i) Uniqueness of hyperfocused 12-arcs, up to projectivities; (ii) Non-existence of hyperfocused 14-arcs. The existence problem for hyperfocused 16-arcs remains open.

Recommendations

• A classification of hyperfocused 12-arcs
• On hyperfocused arcs in \(\mathrm{PG}(2,q)\)
• Projective k-arcs and 2-level secret-sharing schemes
• Hyperfocused arcs
• On the embedding of \((k,p)\)-arcs in maximal arcs

Cites work

• scientific article; zbMATH DE number 4151241 (Why is no real title available?)
• scientific article; zbMATH DE number 5704214 (Why is no real title available?)
• scientific article; zbMATH DE number 3491753 (Why is no real title available?)
• scientific article; zbMATH DE number 3605519 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• Arcs in desarguesian nets
• Embedding 1-factorizations of K_n in PG(2,32)
• Hyperfocused arcs
• Hyperovals in nets of small degree
• New inductive constructions of complete caps in \(\mathrm{PG}(N, q)\), \(q\) even
• Note on (q+2)-Sets in A Galois Plane of Order q
• On 2-level secret sharing
• On hyperfocused arcs in \(\mathrm{PG}(2,q)\)
• On the nuclei of a pointset of a finite projective plane
• On the number of chords of an affinely regular polygon passing through a given point
• Ovals and hyperovals in Desarguesian nets
• Projective k-arcs and 2-level secret-sharing schemes
• Quasi-Perfect Linear Codes With Minimum Distance $4$
• Small complete caps in PG(N, q), q even
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂

Cited in

(6)

• Hyperfocused arcs
• A nonorientable triangular embedding of \(K_ n-K_ 2\), \(n\equiv 8\pmod{12}\)
• Embedding 1-factorizations of K_n in PG(2,32)
• A classification of hyperfocused 12-arcs
• Projective k-arcs and 2-level secret-sharing schemes
• One-factorizations of complete multigraphs arising from maximal \((k;n)\)-arcs in PG\((2,2^h)\)

This page was built for publication: Embedding 1-factorizations of \(K_n\) in \(PG(2,32)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354447)