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 Edit this on Wikidata


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


Cited In (6)





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)