Skip to main content
SpringerLink
Log in

Edge-Connection of Graphs, Digraphs, and Hypergraphs

  • Chapter
More Sets, Graphs and Numbers

Part of the book series: Bolyai Society Mathematical Studies ((BSMS,volume 15))

Abstract

In this work extensions and variations of the notion of edge-connectivity of undirected graphs, directed graphs, and hypergraphs will be considered. We show how classical results concerning orientations and connectivity augmentations may be formulated in this more general setting.

To the memory of C. St. J. A. Nash-Williams and W. T. Tutte who contributed to the area with fundamental results.

The work was started while the author visited the Institute for Discrete Mathematics, University of Bonn, July, 2000. Supported by the Hungarian National Foundation for Scientific Research, OTKA T037547.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Bang-Jensen, H. Gabow, T. Jordán and Z. Szigeti, Edge-connectivity augmentation with partition constraints, SIAM J. Discrete Mathematics, 12 No. 2 (1999), 160–207.

    Article  MATH  Google Scholar 

  2. J. Bang-Jensen and B. Jackson, Augmenting hypergraphs by edges of size two, in: Connectivity Augmentation of Networks: Structures and Algorithms, Mathematical Programming, (ed. A. Frank), Ser. B 84 No. 3 (1999), pp. 467–481.

    Google Scholar 

  3. J. Bang-Jensen, A. Frank and B. Jackson, Preserving and increasing local edge-connectivity in mixed graph, SIAM J. Discrete Math., 8 (1995 May), No. 2, pp. 155–178.

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Benczúr and A. Frank, Covering symmetric supermodular functions by graphs, in: Connectivity Augmentation of Networks: Structures and Algorithms, Mathematical Programming, (ed. A. Frank), Ser. B 84 No. 3 (1999), pp. 483–503.

    Google Scholar 

  5. A. Berg, B. Jackson and T. Jordán, Edge-splitting and connectivity augmentation in directed hypergraphs, Discrete Mathematics, 273 (2003), pp. 71–84.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. Berg, B. Jackson and T. Jordán, Highly edge-connected detachments of graphs and digraphs, J. Graph Theory, 43 (2003), pp. 67–77.

    Article  MATH  MathSciNet  Google Scholar 

  7. F. Boesch and R. Tindell, Robbins’s theorem for mixed multigraphs, Am. Math. Monthly, 87 (1980), 716–719.

    Article  MATH  MathSciNet  Google Scholar 

  8. B. Cosh, B. Jackson and Z. Király, Local connectivity augmentation in hypergraphs is NP-complete, submitted.

    Google Scholar 

  9. J. Edmonds, Edge-disjoint branchings, in: Combinatorial Algorithms, Academic Press, New York (1973), 91–96.

    Google Scholar 

  10. J. Edmonds, Minimum partition of a matroid into independent sets, J. Res. Nat. Bur. Standards Sect., 869 (1965), 67–72.

    MathSciNet  Google Scholar 

  11. J. Edmonds and D. R. Fulkerson, Transversal and matroid partition, Journal of Research of the National Bureau of Standards (B), 69 (1965), 147–153.

    MATH  MathSciNet  Google Scholar 

  12. K. P. Eswaran and R. E. Tarjan, Augmentation problems, SIAM J. Computing, 5 No. 4 (1976), 653–665.

    Article  MATH  MathSciNet  Google Scholar 

  13. B. Fleiner, Detachment of vertices preserving edge-connectivity, SIAM J. on Discrete Mathematics, 3 No. 3. (2005), pp. 581–591.

    MathSciNet  Google Scholar 

  14. T. Fleiner and T. Jordán, Covering and structure of crossing families, in: Connectivity Augmentation of Networks: Structures and Algorithms, Mathematical Programming, (ed. A. Frank), Ser. B 84 No. 3 (1999), pp. 505–518.

    Google Scholar 

  15. L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton Univ. Press, Princeton NJ, 1962.

    MATH  Google Scholar 

  16. A. Frank, On disjoint trees and arborescences, in: Algebraic Methods in Graph Theory, Colloquia Mathematica, Soc. J. Bolyai, North-Holland 25 (1978), 159–169.

    Google Scholar 

  17. A. Frank, Kernel systems of directed graphs, Acta Scientiarum Mathematicarum (Szeged), 41 No. 1–2 (1979), 63–76.

    MATH  Google Scholar 

  18. A. Frank, On the orientation of graphs J. Combinatorial Theory, Ser. B 28 No. 3 (1980), 251–261.

    Article  MATH  Google Scholar 

  19. A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM J. on Discrete Mathematics, 5 No. 1. (1992 February), pp. 22–53.

    Google Scholar 

  20. A. Frank, On a theorem of Mader, Annals of Discrete Mathematics, 101 (1992), 49–57.

    Article  MATH  Google Scholar 

  21. A. Frank, Applications of submodular functions, in: Surveys in Combinatorics, London Mathematical Society Lecture Note Series 187, Cambridge Univ. Press (Ed. K. Walker), 1993, 85–136.

    Google Scholar 

  22. A. Frank, Connectivity augmentation problems in network design, in: Mathematical Programming: State of the Art 1994 (eds.: J. R. Birge and K. G. Murty), The University of Michigan, pp. 34–63.

    Google Scholar 

  23. A. Frank, Orientations of graphs and submodular flows, Congressus Numerantium, 113 (1996) (A. J. W. Hilton, ed.), 111–142.

    Google Scholar 

  24. A. Frank, An intersection theorem for supermodular functions, preliminary draft (2004).

    Google Scholar 

  25. A. Frank and T. Jordán, Minimal edge-coverings of pairs of sets, J. Combinatorial Theory, Ser. B, 65 No. 1 (1995, September), pp. 73–110.

    Article  MATH  Google Scholar 

  26. A. Frank, T. Jordán and Z. Szigeti, An orientation theorem with parity conditions, Discrete Applied Mathematics, 115 (2001), pp. 37–47.

    Article  MATH  MathSciNet  Google Scholar 

  27. A. Frank and Z. Király, Graph orientations with edge-connection and parity constraints, Combinatorica, 22 No. 1. (2002), pp. 47–70.

    Article  MATH  MathSciNet  Google Scholar 

  28. A. Frank and T. Király, Combined connectivity augmentation and orientation problems, in: Submodularity, Discrete Applied Mathematics, guest ed. S. Fujishige, 131 No. 2. (September 2003), pp. 401–419.

    Google Scholar 

  29. A. Frank, T. Király and Z. Király, On the orientation of graphs and hypergraphs, in: Submodularity, Discrete Applied Mathematics, guest ed.: S. Fujishige, 131, No. 2. (September 2003), pp. 385–400.

    Google Scholar 

  30. A. Frank, T. Király and M. Kriesell, On decomposing a hypergraph into k connected sub-hypergraphs, in: Submodularity, Discrete Applied Mathematics, (guest ed. S. Fujishige), 131 No. 2. (September 2003), pp. 373–383.

    Google Scholar 

  31. A. Frank and L. Szegő, Constructive characterizations for packing and covering with trees, in: Submodularity, Discrete Applied Mathematics, (guest ed. S. Fujishige), 131 No. 2. (September 2003), pp. 347–371.

    Google Scholar 

  32. C. Greene and T. L. Magnanti, Some abstract pivot algorithms, SIAM Journal on Applied Mathematics, 29 (1975), 530–539.

    Article  MATH  MathSciNet  Google Scholar 

  33. L. Henneberg, Die graphische Statik der starren Systeme, Leipzig 1911.

    Google Scholar 

  34. T. Jordán and Z. Szigeti, Detachments preserving local edge-connecticity of graphs, SIAM J. Discrete Mathematics, 17 No. 1. (2003), pp. 72–87.

    Article  MATH  Google Scholar 

  35. S. Khanna, J. Naor and F. B. Shepherd, Directed network design with orientation constraints, SIAM J. Discrete Mathematics, to appear in 2005, a preliminary version appeared in: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, Jan. 9–11 (2000), 663–671.

    Google Scholar 

  36. T. Király, Covering symmetric supermodular functions by uniform hypergraphs, J. Combinatorial Theory, Ser. B, 91 (2004), pp. 185–200.

    Article  MATH  Google Scholar 

  37. G. Laman, On graphs and rigidity of plane skeletal structures, J. Engineering Mathematics, 4 (1970), pp. 331–340.

    Article  MATH  MathSciNet  Google Scholar 

  38. M. Lorea, Hypergraphes et matroides, Cahiers Centre Etud. Rech. Oper., 17 (1975), pp. 289–291.

    MATH  MathSciNet  Google Scholar 

  39. L. Lovász, Solution to Problem 11, see pp. 168–169, in: Report on the Memorial Mathematical Contest Miklós Schweitzer of the year 1968 (in Hungarian), Matematikai Lapok, 20 (1969), pp. 145–171.

    Google Scholar 

  40. L. Lovász, 2-matchings and 2-covers of hypergraphs, Acta Mathematica Academiae Scientiarium Hungaricae, 26 (1975), 433–444.

    Article  MATH  Google Scholar 

  41. L. Lovász, On two minimax theorems in graph theory, J. Combinatorial Theory, Ser. B 21 (1976), 96–103.

    Article  MATH  Google Scholar 

  42. L. Lovász, Combinatorial Problems and Exercises, North-Holland 1979.

    Google Scholar 

  43. L. Lovász, Submodular functions and convexity, in: Mathematical, programming — The state of the art, (eds. A. Bachem, M. Grötschel and B. Korte), Springer 1983, 235–257.

    Google Scholar 

  44. W. Mader, Ecken vom Innen-und Aussengrad k in minimal n-fach kantenzusammenhängenden Digraphen, Arch. Math., 25 (1974), 107–112.

    Article  MATH  MathSciNet  Google Scholar 

  45. W. Mader, A reduction method for edge-connectivity in graphs, Ann. Discrete Math., 3 (1978), 145–164.

    Article  MATH  MathSciNet  Google Scholar 

  46. W. Mader, Konstruktion aller n-fach kantenzusammenhängenden Digraphen, Europ. J. Combinatorics, 3 (1982), 63–67.

    MATH  MathSciNet  Google Scholar 

  47. C. St. J. A. Nash-Williams, On orientations, connectivity and odd vertex pairings in finite graphs, Canad. J. Math., 12 (1960), 555–567.

    MATH  MathSciNet  Google Scholar 

  48. C. St. J. A. Nash-Williams, Well-balanced orientations of finite graphs and unobtrusive odd-vertex-pairings in: Recent Progress in Combinatorics ed. W. T. Tutte (1969), Academic Press, pp. 133–149.

    Google Scholar 

  49. C. St. J. A. Nash-Williams, Decomposition of finite graphs into forests, J. London Math. Soc., 39 (1964), 12.

    Article  MATH  MathSciNet  Google Scholar 

  50. C. St. J. A. Nash-Williams, Connected detachments of graphs and generalized Euler trails, J. London Math. Soc., 31 No. 2 (1985), 17–19.

    Article  MATH  MathSciNet  Google Scholar 

  51. C. St. J. A. Nash-Williams, Strongly connected mixed graphs and connected detachments of graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, 19 (1995), 33–47.

    MATH  MathSciNet  Google Scholar 

  52. H. E. Robbins, A theorem on graphs with an application to a problem of traffic control, American Math. Monthly, 46 (1939), 281–283.

    Article  MathSciNet  Google Scholar 

  53. A. Schrijver, A counterexample to a conjecture of Edmonds and Giles, Discrete Mathematics, 32 (1980), 213–214.

    MATH  MathSciNet  Google Scholar 

  54. A. Schrijver, Total dual integrality from directed graphs, crossing families and sub-and supermodular functions, in: Progress in Combinatorial Optimization, (ed. W. R. Pulleyblank), Academic Press (1984), 315–361.

    Google Scholar 

  55. Z. Szigeti, Hypergraph connectivity augmentation, in: Connectivity Augmentation of Networks: Structures and Algorithms, Mathematical Programming, (ed. A. Frank), Ser. B, 84 No. 3 (1999), pp. 519–527.

    Google Scholar 

  56. W. T. Tutte, On the problem of decomposing a graph into n connected factors, J. London Math. Soc., 36 (1961), 221–230.

    Article  MATH  MathSciNet  Google Scholar 

  57. T. Watanabe and A. Nakamura, Edge-connectivity augmentation problems, Computer and System Sciences, 35 No. 1 (1987), 96–144.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research, Eötvös University Egerváry Research Group of the Hungarian Academy of Sciences and Eötvös University Budapest, Pázmány P. s. 1/c, Budapest, Hungary, H-1117

    András Frank

  2. Ericsson Hungary, Lahorc u. 1, Budapest, Hungary, H-1037

    András Frank

Authors
  1. András Frank
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Hungarian Academy of Sciences, Alfréd Rényi Inst. of Mathematics, Reáltanoda u. 13-15, 1053, Budapest, Hungary

    Ervin Győri  & Gyula O. H. Katona  & 

  2. Eötvös University (Budapest)/Microsoft (Seattle), Pázmány Péter sétány 1/C, 1117, Budapest, Hungary

    László Lovász

  3. Budapest University of Technology and Economics, Pázmány Péter sétány 1/D, 1117, Budapest, Hungary

    Tamás Fleiner

Rights and permissions

Reprints and permissions

Copyright information

© 2006 János Bolyai Mathematical Society and Springer Verlag

About this chapter

Cite this chapter

Frank, A. (2006). Edge-Connection of Graphs, Digraphs, and Hypergraphs. In: Győri, E., Katona, G.O.H., Lovász, L., Fleiner, T. (eds) More Sets, Graphs and Numbers. Bolyai Society Mathematical Studies, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32439-3_6

Download citation

Publish with us

Policies and ethics

Search

Navigation