New 2--critical sets in the abelian 2--group

Simple item page
dc.creatorHamalainen, Carlo
dc.date2006-12-13
dc.date.accessioned2026-07-07T06:43:11Z
dc.date.available2026-07-07T06:43:11Z
dc.descriptionIn this paper we determine a class of critical sets in the abelian {2--group} that may be obtained from a greedy algorithm. These new critical sets are all 2--critical (each entry intersects an intercalate, a trade of size 4) and completes in a top down manner.
dc.description25 pages
dc.identifierhttps://arxiv.org/abs/math/0612338
dc.identifierhttp://arxiv.org/abs/math/0612338
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/102322
dc.subjectCombinatorics
dc.subject05B15
dc.titleNew 2--critical sets in the abelian 2--group
dc.typetext

Files

Collections

arXiv