Skip to main content
  • 2466 Accesses

Summary

Matroids are applied in electric engineering for over 30 years. These applications motivated the investigation of some new, pure matroidal questions. Such results are surveyed for readers with mathematical (rather than engineering) background.

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

Access this chapter

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

  • Bouchet, A., Cunningham, W.H.: Delta-matroids, jump systems and bisubmodular polyhedra. SIAM J. Discrete Math. 8, 17–32 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  • Brändén, P.: Polynomials with the half-plane property and matroid theory. Adv. Math. 216, 302–320 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  • Chaiken, S.: A combinatorial proof of the all minors matrix tree theorem. SIAM J. Alg. Discrete Math. 3, 319–329 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  • Chaiken, S., Kleitman, D.J.: Matrix tree theorems. J. Comb. Theory, Ser. A 24, 377–381 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  • Choe, Y.B.: Polynomials with the half-plane property and the support theorems. J. Comb. Theory, Ser. B 94, 117–145 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  • Choe, Y.B.: A combinatorial proof of the Rayleigh formula for graphs. Discrete Math. (2007). doi:10.1016/j.disc.2007.11.011

    Google Scholar 

  • Choe, Y.B., Oxley, J., Sokal, A., Wagner, D.: Homogeneous multivariate polynomials with the half-plane property. Adv. Appl. Math. 32, 88–187 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  • Choe, Y.B., Wagner, D.G.: Rayleigh matroids. Comb. Probab. Comput. 15, 765–781 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Feder, T., Mihail, M.: Balanced matroids. In: Proc. of 24th STOC, pp. 26–38 (1992)

    Google Scholar 

  • Iri, M., Tomizawa, N.: A unifying approach to fundamental problems in network theory by means of matroids. Trans. Inst. Electron. Commun. Eng. Jpn. 58-A, 33–40 (1975)

    MathSciNet  Google Scholar 

  • Kirchhoff, G.: Über die Auflösung der Gleichungen, auf welche man bei der Untersuchungen der linearen Vertheilung galvanischer Ströme geführt wird. Ann. Phys. Chem. 72, 497–508 (1847)

    Article  Google Scholar 

  • Lovász, L.: The membership problem in jump systems. J. Comb. Theory, Ser. B 70, 45–66 (1997)

    Article  MATH  Google Scholar 

  • Lovász, L., Recski, A.: On the sum of matroids. Acta Math. Acad. Sci. Hungar. 24, 329–333 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  • Maxwell, J.C.: Electricity and Magnetism. Clarendon, Oxford (1892)

    Google Scholar 

  • Narayanan, H.: Theory of matroids and network analysis. PhD. thesis, Indian Institute of Technology, Bombay (1974)

    Google Scholar 

  • Recski, A.: On partitional matroids with applications. Colloq. Math. Soc. János Bolyai 10, 1169–1179 (1973)

    MathSciNet  Google Scholar 

  • Recski, A.: On the sum of matroids II. In: Proc. of 5th British Combinatorial Conf., Aberdeen, pp. 515–520 (1975)

    Google Scholar 

  • Recski, A.: An algorithm to determine whether the sum of some graphic matroids is graphic. Colloq. Math. Soc. János Bolyai 25, 647–656 (1981)

    MathSciNet  Google Scholar 

  • Recski, A.: Matroid Theory and Its Applications in Electric Network Theory and in Statics. Springer, Berlin (1989)

    Google Scholar 

  • Recski, A., Szabó, J.: On the generalization of the matroid parity problem. In: Graph Theory. Trends in Mathematics, pp. 347–354. Birkhäuser, Basel (2006)

    Google Scholar 

  • Seymour, P., Welsh, D.J.A.: Combinatorial applications of an inequality from statistical mechanics. Math. Proc. Camb. Philos. Soc. 77, 485–495 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  • Tutte, W.T.: Lectures on matroids. J. Res. Natl. Bur. Stand., Ser. B 69, 1–47 (1965)

    MATH  MathSciNet  Google Scholar 

  • Wagner, D.G.: Matroid inequalities from electrical network theory. Electron. J. Comb. 11 #A1 (2005a)

    Google Scholar 

  • Wagner, D.G.: Rank-three matroids are Rayleigh. Electron. J. Comb. 12 #N81 (2005b)

    Google Scholar 

  • Wagner, D.G., Wei, Y.: A criterion for the half-plane property. Discrete Math. (2008). doi:10.1016/j.disc.2008.02.005

    Google Scholar 

  • Whitney, H.: Non-separable and planar graphs. Trans. Am. Math. Soc. 34, 339–362 (1932)

    Article  MathSciNet  Google Scholar 

  • Whitney, H.: 2-isomorphic graphs. Am. J. Math. 55, 245–254 (1933)

    Article  MathSciNet  Google Scholar 

  • Whitney, H.: On the abstract properties of linear dependence. Am. J. Math. 57, 509–533 (1935)

    Article  MathSciNet  Google Scholar 

  • Whittle, G.: On matroids representable over GF(3) and other fields. Trans. Am. Math. Soc. 349, 579–603 (1997)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Recski, A. (2009). Matroids—the Engineers’ Revenge. In: Cook, W., Lovász, L., Vygen, J. (eds) Research Trends in Combinatorial Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76796-1_18

Download citation

Publish with us

Policies and ethics