Vertex-transitive self-complementary uniform hypergraphs

@inproceedings{Potonika2008VertextransitiveSU,
  title={Vertex-transitive self-complementary uniform hypergraphs},
  author={Primo{\vz} Poto{\vc}nika and Mateja {\vS}ajnac},
  year={2008}
}
  • Primož Potočnika, Mateja Šajnac
  • Published 2008
In this paper we examine the orders of vertex-transitive self-complementary uniform hypergraphs. In particular, we prove that if there exists a vertex-transitive self-complementary k-uniform hypergraph of order n, where k = 2` or k = 2` + 1 and n ≡ 1 (mod 2`+1), then the highest power of any prime dividing n must be congruent to 1 modulo 2`+1. We show that… CONTINUE READING