×

Vertex-transitive self-complementary uniform hypergraphs of prime order. (English) Zbl 1213.05187

Summary: For an integer \(n\) and a prime \(p\), let \(n_{(p)} = \max \{i:p^i\) divides \(n \}\). In this paper, we present a construction for vertex-transitive self-complementary \(k\)-uniform hypergraphs of order \(n\) for each integer \(n\) such that \(p^{n_{(p)}}\equiv 1 (\text{mod }2^{\ell +1})\) for every prime \(p\), where \(\ell =\max\{k_{(2)},(k - 1)_{(2)}\}\), and consequently we prove that the necessary conditions on the order of vertex-transitive self-complementary uniform hypergraphs of rank \(k=2^\ell \) or \(k=^2\ell +1\) due to Potoňick and Šajna are sufficient. In addition, we use Burnside’s characterization of transitive groups of prime degree to characterize the structure of vertex-transitive self-complementary \(k\)-hypergraphs which have prime order \(p\) in the case where \(k=2^\ell \) or \(k=2^\ell +1\) and \(p\equiv 1 (\text{mod }2^{\ell +1})\), and we present an algorithm to generate all of these structures. We obtain a bound on the number of distinct vertex-transitive self-complementary graphs of prime order \(p\equiv 1\)(mod 4), up to isomorphism.

MSC:

05C65 Hypergraphs
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
Full Text: DOI

References:

[1] (Colbourne, C. J.; Dinitz, J. H., Handbook of Combinatorial Designs (2007), Chapman and Hall/CRC Press: Chapman and Hall/CRC Press Boca Raton, Florida) · Zbl 1101.05001
[2] Dobson, E., On groups of prime power degree that contain a full cycle, Discrete Math., 299, 65-78 (2005) · Zbl 1099.20001
[3] Hall Jr., M., The Theory of Groups (1959), Macmillan: Macmillan New York · Zbl 0084.02202
[4] Khosrovshahi, G. B.; Tayfeh-Rezaie, B., Root cases of large sets of \(t\)-designs, Discrete Math., 263, 143-155 (2003) · Zbl 1013.05013
[5] Kocay, W., Reconstructing graphs as subsumed graphs of hypergraphs, and some self-complementary triple systems, Graphs Combin., 8, 259-276 (1992) · Zbl 0759.05064
[6] Peisert, W., All self-complementary symmetric graphs, J. Algebra, 240, 209-229 (2001) · Zbl 1021.05051
[7] Potočnik, P.; Šajna, M., Vertex-transitive self-complementary uniform hypergraphs, European J. Combin., 30, 327-337 (2009) · Zbl 1168.05045
[8] Rao, S. B., On regular and strongly-regular self-complementary graphs, Discrete Math., 54, 73-82 (1985) · Zbl 0562.05027
[9] Teirlink, L., Non-trivial \(t\)-designs without repeated blocks exist for all \(t\), Discrete Math., 65, 301-311 (1987) · Zbl 0625.05005
[10] Wielandt, H., Finite Permutation Groups (1964), Academic Press: Academic Press New York · Zbl 0138.02501
[11] Zassenhaus, H., Über endliche Fastkörper, Abh. Math. Sem. Univ. Hamburg, 11, 187-220 (1936) · JFM 61.0126.01
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.