Skip to main content
Log in

Some Infinite Families of t-Regular Self-complementary k-Hypergraphs

  • Original Paper
  • Published:
Bulletin of the Iranian Mathematical Society Aims and scope Submit manuscript

Abstract

A t-regular self-complementary k-hypergraph, denoted by \(\hbox {SRHG}(t,k,v)\), is a k-hypergraph with a v-set V as vertex set and an edge set E, such that every t-subset of V lies in the same number of edges and there is a permutation \(\sigma \in S_v \) with the property that \(e\in E\) if and only if \(\sigma (e)\notin E\). It is clear that a set of trivial necessary conditions for the existence of an \(\hbox {SRHG}(t,k,v)\) is that \({v-i\atopwithdelims ()k-i}\) is an even integer for all \(i=0,1,...,t\). In this paper, we extend the method of partitionable sets for constructing large sets of t-designs to obtain new \(\hbox {SRHG}(t,k,v)\). In particular, we present \(\hbox {SRHG}(2,3,10)\), \(\hbox {SRHG}(2,4,10)\), \(\hbox {SRHG}(2,4,11)\) and \(\hbox {SRHG}(2,5,10)\). Also we show that the trivial necessary conditions for the existence of \(\hbox {SRHG}(2,k,v)\) with \(k\le 7\) are sufficient.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ajoodani-namini, S., Khosrovshahi, G.B.: More on halving the complete designs. Discrete Math. 135, 29–37 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Gosselin, S.: Constructing regular self-complementary uniform hypergraphs. J. Combin. Des. 19, 439–454 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Khosrovshahi, G.B., Laue, R.: t-Designs, \(t\le 3\). In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 98–110. CRC press, Boca Raton (2007)

    Google Scholar 

  4. Khosrovshahi, G.B., Tayfeh-Rezaie, B.: Root cases of large sets of t-designs. Discrete Math. 263, 143–155 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Khosrovshahi, G.B., Tayfeh-Rezaie, B.: Large sets of \(t\)-designs through partitionable sets: a survey. Discrete Math. 306, 2993–3004 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Knor, M., Potočnik, P.: A note on 2-subset-regular self-complementary 3-uniform hypergraphs. Ars Comb. 111, 33–36 (2013)

    MathSciNet  MATH  Google Scholar 

  7. Potočnik, P., Šajna, M.: The existence of regular self-complementary 3-uniform hypergraphs. Discrete Math. 309, 950–954 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Rao, S.B.: On regular and strongly-regular self-complementary graphs. Discrete Math. 54, 73–82 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  9. Wilson, M.: Decomposition of complete graphs into subgraphs isomophic to a given graph. Congr. Numer. XV, 647–659 (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. Emami.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Emami, M., Naserian, O. Some Infinite Families of t-Regular Self-complementary k-Hypergraphs. Bull. Iran. Math. Soc. 44, 575–584 (2018). https://doi.org/10.1007/s41980-018-0036-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41980-018-0036-7

Keywords

Navigation