Skip to main content
SpringerLink
Log in

Hyperconnectivity of graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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

References

  1. Alon, N.: An extremal problem for sets with application to graph theory. J. Comb. Theory (A) (to appear)

  2. Asimow, L., Roth, B.: The rigidity of graphs. Trans. Am. Math. Soc.245, 279–289 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bollobás, B.: Extremal Graph Theory. London: Academic Press 1978

    MATH  Google Scholar 

  4. Bollobás, B.: Weaklyk-saturated graph. In: Beiträge zur Graphentheorie, edited by Sachs, H., et al., Leipzig: Teubner 1968

    Google Scholar 

  5. Beus, H.: The use of information in sorting. J. Assoc. Comput. Mach.17, 482–495 (1970)

    MATH  MathSciNet  Google Scholar 

  6. Bourbaki, N.: Algebra I. Reading: Addison-Wesley 1974

    MATH  Google Scholar 

  7. Crapo, H.H., Rota, G.C.: Combinatorial Geometries. Cambridge: MIT Press 1970

    MATH  Google Scholar 

  8. Erdös, P., Hajnal, A., Moon, J.W.: A problem in graph theory. Am. Math. Mon.,71, 1107–1110 (1964)

    Article  MATH  Google Scholar 

  9. Frankl, P.: An extremal problem for two families of sets. Europ. J. Comb.3, 125–127 (1982)

    MATH  MathSciNet  Google Scholar 

  10. Kalai, G.: Weakly saturated graphs are rigid. Ann. Discrete Math.20, 189–190 (1984)

    MathSciNet  Google Scholar 

  11. Kalai, G.: Intersection patterns of convex sets. Isr. J. Math.48, 161–174 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kalai, G.: Characterization off-vectors of families of convex sets inR d I. Isr. J. Math.,48, 175–195 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kalai, G.: Enumeration ofQ-acyclic simplicial complexes. Isr. J. Math.45, 337–351 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  14. Laman, G.: On graphs and rigidity of plane skeletal structures. J. Eng. Math.,4, 331–340 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  15. Mader, W.: Existenz gewisser Konfigurationen inn-gesättigten Graphen und in Graphen genügend großer Kantendichte. Math. Ann.194, 295–312 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  16. Mader, W.: Connectivity and edge-connectivity in finite graphs In: Surveys in Combinatorics, edited by Bollobás, B. pp. 66–95 Cambridge: Cambridge Univ. Press 1979

    Google Scholar 

  17. Marcus, M.: Finite Dimensional Multilinear Algebra. New York: Dekker 1975

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA

    Gil Kalai

Authors
  1. Gil Kalai
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported in part by the Weizman fellowship for scientific research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kalai, G. Hyperconnectivity of graphs. Graphs and Combinatorics 1, 65–79 (1985). https://doi.org/10.1007/BF02582930

Download citation

  • Issue Date:

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

Keywords

Search

Navigation