Vertex-transitive self-complementary uniform hypergraphs

@article{Potocnik2009VertextransitiveSU,
  title={Vertex-transitive self-complementary uniform hypergraphs},
  author={Primoz Potocnik and Mateja Sajna},
  journal={Eur. J. Comb.},
  year={2009},
  volume={30},
  pages={327-337}
}
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 this necessary condition is also sufficient in many cases – for example, for n a prime power, and for k = 3 and n odd – thus generalizing… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-4 of 4 extracted citations

Similar Papers

Loading similar papers…