Embedding 1-factorizations of K_n in PG(2,32)
From MaRDI portal
Publication:354447
DOI10.1007/S00373-012-1166-YzbMATH Open1268.05157arXiv0803.3933OpenAlexW2273198177WikidataQ114229682 ScholiaQ114229682MaRDI QIDQ354447FDOQ354447
Authors: Giorgio Faina, Cristiano Parrettini, Fabio Pasticci
Publication date: 19 July 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0803.3933
Recommendations
Cites Work
- Title not available (Why is that?)
- New inductive constructions of complete caps in \(\mathrm{PG}(N, q)\), \(q\) even
- Title not available (Why is that?)
- Small complete caps in PG(N, q), q even
- Quasi-Perfect Linear Codes With Minimum Distance $4$
- There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14
- There are 526,915,620 nonisomorphic one‐factorizations of K12
- On the nuclei of a pointset of a finite projective plane
- On 2-level secret sharing
- Ovals and hyperovals in Desarguesian nets
- Hyperfocused arcs
- Hyperovals in nets of small degree
- Title not available (Why is that?)
- Embedding 1-factorizations of \(K_n\) in \(PG(2,32)\)
- Title not available (Why is that?)
- Arcs in desarguesian nets
- On the number of chords of an affinely regular polygon passing through a given point
- Note on (q+2)-Sets in A Galois Plane of Order q
- Title not available (Why is that?)
- Projective \(k\)-arcs and 2-level secret-sharing schemes
- On hyperfocused arcs in \(\mathrm{PG}(2,q)\)
Cited In (6)
- Hyperfocused arcs
- A nonorientable triangular embedding of \(K_ n-K_ 2\), \(n\equiv 8\pmod{12}\)
- A classification of hyperfocused 12-arcs
- Embedding 1-factorizations of \(K_n\) in \(PG(2,32)\)
- 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)