Skip to main content
SpringerLink
Log in

Determination of the packing number D λ(3,W (3)4 ,ν)

  • Published:
Science in China Series A: Mathematics Aims and scope Submit manuscript

Abstract

A t-hyperwheel (t ⩾ 3) of length l (or W (t) l for brevity) is a t-uniform hypergraph (V,E), where E = {e 1, e 2,..., e l } and ν1, ν2,..., ν l are distinct vertices of V = ∪ l i=1 such that for i = 1,..., l, ν i , ν i+1 ∈ e i and e i ∩ e j = P, j ∉ {i - 1, i, i + 1}, where the operation on the subscripts is modulo l and P is a vertex of V which is different from ν i , 1 ⩽ i ⩽ l. In this paper, we investigate the maximum packing problem of MP λ(3,W (3)4 , ν). Finally, the packing number D λ(3,W (3)4 , ν) is determined for any positive integers ν ⩾ 5 and λ.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berge C. Hypergraphs: Combinatorics of Finite Sets. Amsterdam: North Holland, 1989

    MATH  Google Scholar 

  2. Beth T, Jungnickel D, Lenz H. Design Theory. Cambridge: Cambridge University Press, 1999

    Google Scholar 

  3. Hanani H. On some tactical configurations. Canad J Math, 15: 702–722 (1963)

    MATH  MathSciNet  Google Scholar 

  4. Berge C. Graphs and Hypergraphs. Amsterdam: North Holland, 1973

    MATH  Google Scholar 

  5. Alspach B, Gavlas H, Šajna M, et al. Cycle decompositions IV: Complete directed graphs and fixed length directed cycles. J Combin Theory Ser A, 103: 165–208 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Feng T, Chang Y. Decompositions of the 3-uniform hypergraphs K (3)ν into hypergraphs of a certain type. Sci China Ser A, 50: 1035–1044 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. Wu Y, Chang Y. On the maximum packing problem of MP λ(3,K (3)4 −e, ν). Ars Combin, to appear

  8. MoháLacsy H, Ray-Chaudhuri D K. Candelabra systems and designs. J Statist Plann Inference, 106: 419–448 (2002)

    Article  MathSciNet  Google Scholar 

  9. Hartman A. The fundamental construction for 3-designs. Discrete Math, 124: 107–132 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  10. Mills W H. On the existence of H designs. Congr Numer, 79: 129–141 (1990)

    MATH  MathSciNet  Google Scholar 

  11. Hartman A, Phelps K T. Steiner quadruple systems. In: Contemporary Design Theory. Dinitz J H, Stinson D R, eds. New York: Wiley, 1992, 205–240

    Google Scholar 

  12. Mills W H. On the covering of triples by quadruples. Congr Numer, 10: 563–586 (1974)

    MathSciNet  Google Scholar 

  13. Crescenzo G D, Galdi C. Hypergraph decomposition and secret sharing. Discrete Appl Math, 157(5): 928–946 (2009)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Beijing Jiaotong University, Beijing, 100044, China

    Yan Wu & YanXun Chang

Authors
  1. Yan Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. YanXun Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to YanXun Chang.

Additional information

This work was supported by National Natural Science Foundation of China (Grant Nos. 10771013, 10831002)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, Y., Chang, Y. Determination of the packing number D λ(3,W (3)4 ,ν). Sci. China Ser. A-Math. 52, 2537–2548 (2009). https://doi.org/10.1007/s11425-009-0176-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11425-009-0176-6

Keywords

MSC(2000)

Search

Navigation