''Combinatorica'' is an international journal of mathematics, publishing papers in the fields of

combinatorics Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many a ...

and

computer science Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to practical disciplines (includin ...

. It started in 1981, with László Babai and

László Lovász László Lovász (; born March 9, 1948) is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson. He wa ...

as the editors-in-chief with Paul Erdős as honorary editor-in-chief. The current editors-in-chief are

Imre Bárány Imre Bárány (Mátyásföld, Budapest, 7 December 1947) is a Hungarian mathematician, working in combinatorics and discrete geometry. He works at the Rényi Mathematical Institute of the Hungarian Academy of Sciences, and has a part-time app ...

and József Solymosi. The advisory board consists of Ronald Graham,

Gyula O. H. Katona Gyula O. H. Katona (born 16 March 1941 in Budapest) is a Hungarian mathematician known for his work in combinatorial set theory, and especially for the Kruskal–Katona theorem and his beautiful and elegant proof of the Erdős–Ko–Rado the ...

, Miklós Simonovits, Vera Sós, and

Endre Szemerédi Endre Szemerédi (; born August 21, 1940) is a Hungarian-American mathematician and computer scientist, working in the field of combinatorics and theoretical computer science. He has been the State of New Jersey Professor of computer science a ...

. It is published by the János Bolyai Mathematical Society and

Springer Verlag Springer Science+Business Media, commonly known as Springer, is a German multinational publishing company of books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing. Originally founded in 1842 in ...

. The following members of the ''

Hungarian School of Combinatorics Hungarian may refer to: * Hungary, a country in Central Europe * Kingdom of Hungary, state of Hungary, existing between 1000 and 1946 * Hungarians, ethnic groups in Hungary * Hungarian algorithm, a polynomial time algorithm for solving the assig ...

'' have strongly contributed to the journal as authors, or have served as editors: Miklós Ajtai, László Babai, József Beck,

András Frank András Frank (born 3 June 1949) is a Hungarian mathematician, working in combinatorics, especially in graph theory, and combinatorial optimisation. He is director of the Institute of Mathematics of the Faculty of Sciences of the Eötvös Lorá ...

Péter Frankl Péter Frankl (born 26 March 1953 in Kaposvár, Somogy County, Hungary) is a mathematician, busking, street performer, columnist and educator, active in Japan. Frankl studied Mathematics at Eötvös Loránd University in Budapest and submitted ...

Zoltán Füredi Zoltán Füredi (Budapest, Hungary, 21 May 1954) is a Hungarian mathematician, working in combinatorics, mainly in discrete geometry and extremal combinatorics. He was a student of Gyula O. H. Katona. He is a corresponding member of the Hungarian ...

, András Hajnal,

Gyula Katona Gyula Katona may refer to: * Gyula O. H. Katona, Hungarian mathematician and father of Gyula Y. Katona * Gyula Y. Katona Gyula Y. Katona (born 4 December 1965) is a Hungarian mathematician, the son of mathematician Gyula O. H. Katona. He receive ...

László Pyber ''László Pyber'' (born 8 May 1960 in Budapest) is a Hungarian mathematician. He is a researcher at the Alfréd Rényi Institute of Mathematics, Budapest. He works in combinatorics and group theory. Biography Pyber received his Ph.D. from t ...

Alexander Schrijver Alexander (Lex) Schrijver (born 4 May 1948 in Amsterdam) is a Dutch mathematician and computer scientist, a professor of discrete mathematics and optimization at the University of Amsterdam and a fellow at the Centrum Wiskunde & Informatica in Ams ...

, Miklós Simonovits, Vera Sós,

Tamás Szőnyi Tamás Szőnyi (born July 23, 1957, Budapest) is a Hungarian mathematician, doing research in discrete mathematics, particularly finite geometry and algebraic coding theory. He is full professor at the Department of Computer Science of the Eötvö ...

, Éva Tardos,

Gábor Tardos Gábor Tardos (born 11 July 1964) is a Hungarian mathematician, currently a professor at Central European University and previously a Canada Research Chair at Simon Fraser University. He works mainly in combinatorics and computer science. He is ...

.{{cite web, url=https://www.springer.com/mathematics/numbers/journal/493?detailsPage=editorialBoard, title=EDITORIAL BOARD, website=springer.com, accessdate=10 March 2010

Notable publications

* A paper by Martin Grötschel,

, and

on the ellipsoid method, awarded the 1982

Fulkerson Prize The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at e ...

. ::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, awarded the 1985

. ::J. Beck: Roth's estimate of the discrepancy of integer sequences is nearly sharp, ''Combinatorica'', 1(1981), 319–325. *

Karmarkar's algorithm Karmarkar's algorithm is an algorithm introduced by Narendra Karmarkar in 1984 for solving linear programming problems. It was the first reasonably efficient algorithm that solves these problems in polynomial time. The ellipsoid method is also po ...

solving linear programming problems in polynomial time, awarded the 1988

. :: N. Karmarkar: A New Polynomial Time Algorithm for Linear Programming, ''Combinatorica'', 4(1984), 373–395. * Szegedy's solution of Graham problem on common divisors :: M. Szegedy: The solution of Graham's greatest common divisor problem, ''Combinatorica'', 6(1986), 67–71. * Éva Tardos's paper, awarded the 1988

. ::E. Tardos, A strongly polynomial minimum cost circulation algorithm, ''Combinatorica'', 5(1985), 247–256. * The proof of El-Zahar and

Norbert Sauer Norbert is a Germanic given name, from ''nord'' "north" and '' berht'' "bright". Norbert is also occasionally found as a surname. People with the given name Academia * Norbert Angermann (born 1936), German historian * Norbert A’Campo (born 19 ...

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. * 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. * Neil Robertson, Paul Seymour, and Robin Thomas, proving Hadwiger's conjecture in the case ''k''=6, awarded the 1994

. ::N. Robertson, P. D. Seymour, R. Thomas: Hadwiger's conjecture for K₆-free graphs, ''Combinatorica'', 13 (1993), 279–361.

References

External links

* Combinatorica'
homepage

Combinatorica on-line
at Springer. Combinatorics journals Computer science journals Springer Science+Business Media academic journals Publications established in 1981