Skip to main content
Log in

Set systems with no union of cardinality 0 modulom

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Letq be a prime power. It is shown that for any hypergraph = {F 1,...,F d(q−1)+1} whose maximal degree isd, there exists Ø ≠ ℱ0 ⊂ ℱ, such that

≡ 0 (modq).

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. Alon, N., Friedland, S. and Kalai, G.: Regular subgraphs of almost regular graphs. J. Comb. Theory, Ser. B.37, 79–91 (1984)

    Google Scholar 

  2. Baker, R.C., Schmidt, W.M.: Diophantine problems in variables restricted to the values 0 and 1. J. Number Theory12, 460–486 (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alon, N., Kleitman, D., Lipton, R. et al. Set systems with no union of cardinality 0 modulom . Graphs and Combinatorics 7, 97–99 (1991). https://doi.org/10.1007/BF01788135

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01788135

Keywords

Navigation