View source for Combinatorica

{{Infobox journal
| title         = Combinatorica
| cover         = 
| caption       = 
| former_name   = <!-- or |former_names= -->
| abbreviation  = Combinatorica
| discipline    = Mathematics
| peer-reviewed = 
| language      = 
| editor        = [[Biography:Imre Bárány|Imre Bárány]] and [[Biography:József Solymosi|József Solymosi]]
| publisher     = [[Company:Springer Science+Business Media|Springer]] for the János Bolyai Mathematical Society
| country       = Germany
| history       = 1981 to present
| frequency     = Bimonthly
| openaccess    = 
| license       = 
| impact        = 
| impact-year   = 
| ISSNlabel     =
| ISSN          =  0209-9683 
| eISSN         = 1439-6912 
| CODEN         =
| JSTOR         = 
| LCCN          = 
| OCLC          =
| website       = https://www.springer.com/new+%26+forthcoming+titles+%28default%29/journal/493
| link1         =
| link1-name    =
| link2         = <!-- up to |link5= -->
| link2-name    = <!-- up to |link5-name= -->
| boxwidth      = 
}}

'''''Combinatorica''''' is an international journal of [[Mathematics|mathematics]], publishing papers in the fields of [[Combinatorics|combinatorics]] and [[Computer science|computer science]]. It started in 1981, with [[Biography:László Babai|László Babai]] and [[Biography:László Lovász|László Lovász]] as the editors-in-chief with [[Biography:Paul Erdős|Paul Erdős]] as honorary editor-in-chief. The current editors-in-chief are [[Biography:Imre Bárány|Imre Bárány]] and [[Biography:József Solymosi|József Solymosi]]. The advisory board consists of [[Biography:Ronald Graham|Ronald Graham]], [[Biography:Gyula O. H. Katona|Gyula O. H. Katona]], [[Biography:Miklós Simonovits|Miklós Simonovits]], Vera Sós, and [[Biography:Endre Szemerédi|Endre Szemerédi]]. It is published by the János Bolyai Mathematical Society and Springer Verlag.

The following members of the ''Hungarian School of Combinatorics'' have strongly contributed to the journal as authors, or have served as editors: [[Biography:Miklós Ajtai|Miklós Ajtai]], [[Biography:László Babai|László Babai]], József Beck, [[Biography:András Frank|András Frank]], [[Biography:Péter Frankl|Péter Frankl]], [[Biography:Zoltán Füredi|Zoltán Füredi]], [[Biography:András Hajnal|András Hajnal]], [[Biography:Gyula O. H. Katona|Gyula Katona]], [[Biography:László Lovász|László Lovász]], [[Biography:László Pyber|László Pyber]], [[Biography:Alexander Schrijver|Alexander Schrijver]], [[Biography:Miklós Simonovits|Miklós Simonovits]], Vera Sós, [[Biography:Endre Szemerédi|Endre Szemerédi]], [[Biography:Tamás Szőnyi|Tamás Szőnyi]], [[Biography:Éva Tardos|Éva Tardos]], [[Biography:Gábor Tardos|Gábor Tardos]].<ref>{{cite web|url=http://www.combinatorica.hu/kezdolap.html|title=EDITORS|website=combinatorica.hu|accessdate=10 March 2010|archive-url=https://web.archive.org/web/20110721104414/http://www.combinatorica.hu/kezdolap.html|archive-date=21 July 2011|url-status=dead}}</ref><ref>{{cite web|url=https://www.springer.com/mathematics/numbers/journal/493?detailsPage=editorialBoard|title=EDITORIAL BOARD|website=springer.com|accessdate=10 March 2010}}</ref>

==Notable publications==
* A paper by Martin Grötschel, [[Biography:László Lovász|László Lovász]], and [[Biography:Alexander Schrijver|Alexander Schrijver]] on the [[Ellipsoid method|ellipsoid method]], awarded the 1982 Fulkerson Prize.
::M. Grötschel, L. Lovász, A. Schrujver: The ellipsoid method and its consequences in combinatorial optimization, ''Combinatorica'', '''1'''(1981), 169–197.
* József Beck's paper on the [[Discrepancy of hypergraphs|discrepancy of hypergraphs]], awarded the 1985 Fulkerson Prize. 
::J. Beck: [[Biography:Klaus Roth|Roth]]'s estimate of the discrepancy of integer sequences is nearly sharp, ''Combinatorica'', '''1'''(1981), 319–325.
* [[Karmarkar's algorithm]] solving linear programming problems in polynomial time, awarded the 1988 Fulkerson Prize.
::[[Biography:Narendra Karmarkar|N. Karmarkar]]: A New Polynomial Time Algorithm for Linear Programming, ''Combinatorica'', '''4'''(1984), 373–395.
* Szegedy's solution of Graham problem on common divisors
::[[Biography:Mario Szegedy|M. Szegedy]]: The solution of Graham's greatest common divisor problem,  ''Combinatorica'',  '''6'''(1986),  67–71.
* [[Biography:Éva Tardos|Éva Tardos]]'s paper, awarded the 1988 Fulkerson Prize. 
::E. Tardos, A strongly polynomial minimum cost                       circulation algorithm, ''Combinatorica'', '''5'''(1985), 247–256.
* The proof of El-Zahar and Norbert Sauer of the [[Hedetniemi's conjecture]] for 4-chromatic graphs. 
::M. El-Zahar, N. W. Sauer: The chromatic number of the product of two 4-chromatic graphs is 4, '' Combinatorica'', '''5'''(1985), 121–126.
* [[Biography:Béla Bollobás|Bollobás]]'s asymptotic value of the chromatic number of random graphs. 
::B. Bollobás: The chromatic number of random graphs, ''Combinatorica'',  '''8'''(1988), 49–55. 
* [[Biography:Neil Robertson (mathematician)|Neil Robertson]], Paul Seymour, and [[Biography:Robin Thomas (mathematician)|Robin Thomas]], proving [[Hadwiger conjecture (graph theory)|Hadwiger's conjecture]] in the case ''k''=6, awarded the 1994 Fulkerson Prize.
::N. Robertson, P. D. Seymour, R. Thomas: Hadwiger's conjecture for K<sub>6</sub>-free graphs, ''Combinatorica'', '''13 '''(1993), 279–361.

==References==
<references/>

== External links ==
* Combinatorica's [https://web.archive.org/web/20170920053242/http://combinatorica.hu/ homepage]. 
* [http://springerlink.metapress.com/openurl.asp?genre=journal&amp;issn=0209-9683 Combinatorica on-line] at Springer.

[[Category:Computer science journals]]

{{Sourceattribution|Combinatorica}}