Skip to main content
SpringerLink
Log in

Some good characterization results relating to the Kőnig–Egerváry theorem

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

We survey some combinatorial results which are all related to some former results of ours, and, at the same time, they are all related to the famous Kőnig–Egerváry theorem from 1931.

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

Similar content being viewed by others

References

  • Arkin EM, Hassin R, Rubinstein S, Svidirenko M (2002) Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems. In: Penttonen M, Meineche E Schmidt (eds) SWAT2002, LNCS2368, pp 280–287

  • Arkin EM, Hassin R, Rubinstein S, Svidirenko M (2004) Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems. Algorithmica 39: 175–187

    Article  Google Scholar 

  • Biró M, Hujter M, Tuza Z (1992) Precoloring extension I. Interval graphs. Discrete Math 100: 267–279

    Article  Google Scholar 

  • Blázsik Z, Hujter M, Pluhár A, Tuza Z (1993) Graphs with no induced C 4 and 2K 2. Discrete Math 115: 51–55

    Article  Google Scholar 

  • Egerváry J (1931) Matrixok kombinatorius tulajdonságairól [in Magyar with German summary] Matematikai és Fizikai Lapok, 38, pp 16–28 [English trans. by Kuhn HW]: On combinatorial properties of matrices, Logistics Papers, George Washington University, 11, pp 1–11 (1955)

  • Egerváry E (1958) Bemerkungen zum transport problem. MTW Mitt 5: 278–284

    Google Scholar 

  • Egerváry E (1958) Kombinatorikus módszer a szállítási probléma megoldására. A Matematikai Kutató Intézet közleményei 4(1): 15–28

    Google Scholar 

  • Földes S, Hammer PL (1977) Split graphs. In: Hoffmann F, et al (eds) Proceedings of the 8th southeastern conference on combinatorics, graph theory and computing, Lousiana State University, Baton Rouge, Louisiana, pp 311–315

  • Frankl P (1987) The shifting technique in extremal set theory. In: Whitehead C (ed) Surveys in combinatorics 1987, invited papers for the 11th British combinatorial conference, London Math Soc Lect Note Series 123, Cambridge University Press, pp 81–110

  • Frankl P, Füredi Z (1986) Extremal problems concerning Kneser graphs. J Combin Theory B 40: 270–284

    Article  Google Scholar 

  • Frankl P, Füredi Z (1991) Beyond the Erdős–Ko–Rado theorem. J Combin Theory A 56: 182–194

    Article  Google Scholar 

  • Frobenius G (1968) Über zerlegbare Determinanten, Sitzungsb erichte der Königlich Preußischen Akademie der Wissenschaften zu Berlin, pp 274–277 (1917) [reprinted in: Ferdinand Georg Frobenius, Gesammelte Abhandlungen, Band III Serre J-P (ed) Springer, Berlin, pp 701–704]

  • Golumbic MC (1980) Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York

    Google Scholar 

  • Guruswami V (1999) Enumerative aspects of certain subclasses of perfect graphs. Discrete Math 205: 97–117

    Article  Google Scholar 

  • Gyárfás A, Lehel J (1970) On a Helly type problem in trees. Colloq Math Societatis János Bolyai 4: 571–584

    Google Scholar 

  • Hujter M (1981) A combinatorial optimization problem: classical and computerized methods. Translation of M.S. Thesis from Magyar, Eötvös University, Budapest available at http://picasaweb.google.hu/Hujter.Misi/1981

  • Hujter M (1992) Hungarian method [in Magyar]. Iskolakultúra Math–Inf–Tech 2: 15–20

    Google Scholar 

  • Hujter M (1999) Simplified and strengthened methods for the transportation problem with a permuted demand vector (unpublished)

  • Hujter M, Tuza Z (1993) Precoloring extension II. Graphs classes related to bipartite graphs. Acta Math Univ Comeniane LXII: 1–11

    Google Scholar 

  • Hujter M, Tuza Z (1996) Precoloring extension III. Classes of perfect graphs. Combin Probab Comput 5: 35–56

    Article  Google Scholar 

  • Hujter M, Klinz B, Woeginger G (1999) Transportation problem with permuted demand vector. Math Methods Oper Res 50: 9–16

    Google Scholar 

  • König D (1916) Über graphen und iher anwendung auf determinantentheorie und mengenlehre. Math Ann 77: 453–465

    Article  Google Scholar 

  • Kőnig D (1931) Graphok és matrixok [in Magyar]. Math és Fizikai Lapok 38: 116–119

    Google Scholar 

  • Kőnig D (2005) A letter to Kalmár L [in Magyar]. October 3, 1945; published in P.G.Szabó, Kalmárium I, Polygon, Szeged

  • Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res Logistic Q 2: 83–97

    Article  Google Scholar 

  • Lubell D (1966) A short proof of Sperner theorem. J Combin Theory 1: 299

    Article  Google Scholar 

  • Meusel SG (1998) Minimizing the placement time on circuit boards. Ph.D.Thesis, Techn. Univ. Bergakademie Freiberg

  • Meusel SG, Burkard RE (1999) A transportation problem with a permuted demand vector. Math Methods Oper Res 50: 1–7

    Google Scholar 

  • Rényi A (1945) A letter to F. Riesz [in Magyar], July 5, 1945. Eötvös University, Mathematics Inst., Budapest

  • Sperner E (1928) Ein Satz über Untermengen einer endlichen Menge. Math Z 27: 544–548

    Article  Google Scholar 

  • Steinbrecher B (1997) Ein Transport problem mit permutiertem Bedarfsvektor [in German], Master’s thesis, TU Bergakademe Freiberg

Download references

Author information

Authors and Affiliations

  1. Budapest University of Technology and Economics, Budapest, Hungary

    Mihály Hujter

Authors
  1. Mihály Hujter
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mihály Hujter.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hujter, M. Some good characterization results relating to the Kőnig–Egerváry theorem. Cent Eur J Oper Res 18, 37–45 (2010). https://doi.org/10.1007/s10100-009-0126-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-009-0126-y

Keywords

Search

Navigation