Skip to main content
SpringerLink
Log in

Extremal combinatorial problems in relational data base

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 117))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. CODD, E.F., A relational model of data for large shared data banks, Comm. ACM 13(1970) 377–387.

    Google Scholar 

  2. SPERNER, E., Ein Satz über Untermengen einer endlichen Menge, Math. Z. 27 (1928) 544–548.

    Google Scholar 

  3. DEMETROVICS, J., On the equivalence of candidate keys with Sperner Systems, Acta Cybernetica 4 (1979) 247–252.

    Google Scholar 

  4. BEKESSY, J., DEMETROVICS, J., HANNAK, K., FRANKL, P. and KATONA, G.O.H., On the number of maximal dependencies in a data base relation of fixed order, Disc. Math. 30(1980) 83–88.

    Google Scholar 

  5. DEMETROVICS, J. and GYEPESI, GY., On the functional dependency and some generalization of it (to appear in Acta Cybernetica).

    Google Scholar 

  6. RAY-CHAUDHURI, D.K., and WILSON, R.M., Solution of Kirkman's school girl problem, Proc. Symp. in Pure Math., Combinatorics, Am. Math. Soc. 19(1971) 187–204.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer and Automation Institute Hungarian Academy of Sciences, Hungary

    J. Demetrovics

  2. Mathematical Institute of the Hungarian Academy of Sciences, Hungary

    G. O. H. Katona

Authors
  1. J. Demetrovics
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. O. H. Katona
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Demetrovics, J., Katona, G.O.H. (1981). Extremal combinatorial problems in relational data base. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-10854-8_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10854-2

  • Online ISBN: 978-3-540-38765-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation