Opuscula Math. 43, no. 5 (2023), 663-673

The existence of bipartite almost self-complementary 3-uniform hypergraphs

L.N. Kamble
C.M. Deshpande
B.P. Athawale
Abstract. An almost self-complementary 3-uniform hypergraph on \(n\) vertices exists if and only if \(n\) is congruent to 3 modulo 4 A hypergraph \(H\) with vertex set \(V\) and edge set \(E\) is called bipartite if \(V\) can be partitioned into two subsets \(V_1\) and \(V_2\) such that \(e\cap V_1\neq \emptyset\) and \(e\cap V_2\neq \emptyset\) for any \(e\in E\). A bipartite self-complementary 3-uniform hypergraph \(H\) with partition \((V_1, V_2)\) of the vertex set \(V\) such that \(|V_1|=m\) and \(|V_2|=n\) exists if and only if either (i) \(m=n\) or (ii) \(m\neq n\) and either \(m\) or \(n\) is congruent to 0 modulo 4 or (iii) \(m\neq n\) and both \(m\) and \(n\) are congruent to 1 or 2 modulo 4. In this paper we define a bipartite almost self-complementary 3-uniform hypergraph \(H\) with partition \((V_1, V_2)\) of a vertex set \(V\) such that \(|V_1|=m\) and \(|V_2|=n\) and find the conditions on \(m\) and \(n\) for a bipartite 3-uniform hypergraph \(H\) to be almost self-complementary. We also prove the existence of bi-regular bipartite almost self-complementary 3-uniform hypergraphs.
Keywords: almost self-complementary 3-uniform hypergraph, bipartite hypergraph, bipartite self-complementary 3-uniform hypergraph, bipartite almost self-complementary 3-uniform hypergraph.
Mathematics Subject Classification: 05C65.
References ▼
  1. [1] C.R.J. Clapham Graphs self-Complementary in \(K_n-e\), Discrete Math. 81 (1990), 229-235.
  2. [2] T. Gangopadhyay, S.P. Rao Hebbare, Structural properties of \(r\)-partite complementing permutations, Tech. Report No. 19/77, I.S.I, Calcutta.
  3. [3] S. Gosselin, Generating self-complementary uniform hypergraphs, Discrete Math. 310 (2010), 1366-1372. https://doi.org/10.1016/j.disc.2010.01.003
  4. [4] L.N. Kamble, C.M. Deshpande, B.Y. Bam, Existence of quasi-regular and bi-regular self-complementary 3-uniform hypergraphs, Discuss. Math. Graph Theory 36 (2016), 419-426. https://doi.org/10.7151/dmgt.1862
  5. [5] L.N. Kamble, C.M. Deshpande, B.Y. Bam, Almost self-complementary 3-uniform hypergraphs , Discuss. Math. Graph Theory 37 (2017), 131-140. https://doi.org/10.7151/dmgt.1919
  6. [6] L.N. Kamble, C.M. Deshpande, B.P. Athawale, On self-complementary bipartite 3-uniform hypergraph, Ars. Combin. 146 (2019), 293-305.
  7. [7] L.N. Kamble, C.M. Deshpande, B.P. Athawale, The existence of regular and quasi-regular bipartite self-complementary 3-uniform hypergraphs, J. Comb. Math. Comb. Comput. 111 (2019), 257-268.
  8. [8] P. Potočnik, M. Šajana, The existence of regular self-complementary 3-uniform hypergraphs, Discrete Math. 309 (2009), 950-954.
  9. [9] A. Szymański, A.P. Wojda, A note on \(k\)-uniform self-complementary hypergraphs of given order, Discuss. Math. Graph Theory 29 (2009), 199-202. https://doi.org/10.7151/dmgt.1440
  10. [10] A. Szymański, A.P. Wojda, Self-complementing permutations of \(k\)-uniform hypergraphs, Discrete Math. Theor. Comput. Sci. 11 (2009), 117-124. https://doi.org/10.46298/dmtcs.468
  11. [11] A.P. Wojda, Almost self-complementary uniform hypergraphs, Discuss. Math. Graph Theory 38 (2018), 607-610. https://doi.org/10.7151/dmgt.2028
  12. [12] A.P. Wojda, Self complementary hypergraphs, Discuss. Math. Graph Theory 26 (2006), 217-224. https://doi.org/10.7151/dmgt.1314
About the authors ▼
L.N. Kamble (corresponding author)
MES's Abasaheb Garware College, Pune, Department of Mathematics, Pune - 411004, Maharashtra, India
C.M. Deshpande
College of Engineering Pune, Department of Mathematics, Pune - 411005, Maharashtra, India
B.P. Athawale
College of Engineering Pune, Department of Mathematics, Pune - 411005, Maharashtra, India
About the article ▼
Communicated by Adam Paweł Wojda.
Received: 2023-01-23.
Revised: 2023-05-05.
Accepted: 2023-05-20.
Published online: 2023-06-24.
Cite this article as ▼
L.N. Kamble, C.M. Deshpande, B.P. Athawale, The existence of bipartite almost self-complementary 3-uniform hypergraphs, Opuscula Math. 43, no. 5 (2023), 663-673, https://doi.org/10.7494/OpMath.2023.43.5.663.
Download this article's citation as: