A note on 2-subset-regular self-complementary 3-uniform hypergraphs

Simple item page
dc.creatorKnor, Martin
dc.creatorPotocnik, Primoz
dc.date2008-04-22
dc.date.accessioned2026-07-07T09:34:01Z
dc.date.available2026-07-07T09:34:01Z
dc.descriptionWe show that a 2-subset-regular self-complementary 3-uniform hypergraph with $n$ vertices exists if and only if $n\ge 6$ and $n$ is congruent to 2 modulo 4.
dc.identifierhttps://arxiv.org/abs/0804.3541
dc.identifierhttp://arxiv.org/abs/0804.3541
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/159342
dc.subjectCombinatorics
dc.subject05C65
dc.titleA note on 2-subset-regular self-complementary 3-uniform hypergraphs
dc.typetext

Files

Collections

arXiv