Discrete Mathematics (journal)

Discrete Mathematics (journal)
Discrete Mathematics  
Cover of Discrete Mathematics, featuring the Petersen graph.
Abbreviated title (ISO) Discrete Math.
Discipline Mathematics
Peer-reviewed Yes
Language English
Edited by Douglas B. West
Publication details
Publisher Elsevier
Publication history 1971–present
Frequency 24 issues per year
Impact factor
(2010)
0.548
Indexing
ISSN 0012-365X

Discrete Mathematics is a journal in the broad area of discrete mathematics, combinatorics, graph theory and their applications, published by Elsevier. It publishes both short notes, full length contributions, as well as survey articles. In addition, DM publishes a number of special issues each year dedicated to a particular topic, in total 24 regular and special issues a year. All published articles are also available electronically, by subscription. Although originally it allowed publications in French and German, it now allows only English language articles. Like other Elsevier publications, the journal uses an electronic submission system.

Contents

History

The journal was established in 1971, under the leadership of Peter Hammer, with an advisory board consisting of Claude Berge, M. Harrison, Victor Klee, Jack van Lint, and Gian-Carlo Rota. The very first article it published was written by Paul Erdős, who went on to publish a total of 84 papers in DM.

One of the oldest and leading journals in the field, Discrete Mathematics has published a number of articles by many well known combinatorialists. These include Noga Alon (25 papers), László Babai, Béla Bollobás (41 papers), Leonard Carlitz, Fan Chung (10 papers), Václav Chvátal, Don Coppersmith, Persi Diaconis, Philippe Flajolet, Ron Graham, Branko Grünbaum, Richard Guy, Gil Kalai, Daniel Kleitman (25 papers), Donald Knuth, László Lovász, Jaroslav Nešetřil (27 papers), Cheryl Praeger (11 papers), John Riordan, Marcel-Paul Schützenberger, Vera Sós (10 papers), Joel Spencer, Richard Stanley, Endre Szemerédi, W. T. Tutte, Herb Wilf, and Doron Zeilberger (16 papers).

The journal was one of the first in the area of discrete mathematics and remained the broadest. Over the years it grew enormously along with the growth of the field, reaching the point of publishing 3500 pages per year. Hammer remained the managing editor until his death in 2006. In 2007 the editorial structure was overhauled and the journal became more selective. The new editor-in-chief is Douglas West, with managing editor Wayne Goddard and six associate editors who consider submissions by subfields.

Editorial board

Associate editors

Notable publications

References

  1. ^ Lovász, László (1972). "Normal hypergraphs and the perfect graph conjecture". Discrete Mathematics 2 (3): 253–267. doi:10.1016/0012-365X(72)90006-4. 
  2. ^ Stanley, R. P. (1973). "Acyclic orientations of graphs". Disc. Math. 5 (2): 171–178. doi:10.1016/0012-365X(73)90108-8. 
  3. ^ Chvátal, Václav (1973). "Tough graphs and Hamiltonian circuits". Discrete Mathematics 5 (3): 215–228. doi:10.1016/0012-365X(73)90138-6. MR0316301. 
  4. ^ Citations, from Google Scholar.
  5. ^ Gates, W. and Papadimitriou, C., "Bounds for Sorting by Prefix Reversal.", Discrete Mathematics. 27, 47-57, 1979.
  6. ^ Pancake Sorting, Ivars Peterson, Mathematical Association of America, September 4 , 2006: “It's the only technical paper that Bill Gates, co-founder of Microsoft, ever published.”
  7. ^ P. Flajolet, Combinatorial aspects of continued fractions, Discrete Math. 32 (1980), 125–161.
  8. ^ Zeilberger, Doron; Bressoud, David M. (1985). "A proof of Andrews' q-Dyson conjecture". Discrete Mathematics 54 (2): 201–224. doi:10.1016/0012-365X(85)90081-0. ISSN 0012-365X. MR791661. 

External links


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Discrete mathematics — For the mathematics journal, see Discrete Mathematics (journal). Graphs like this are among the objects studied by discrete mathematics, for their interesting mathematical properties, their usefulness as models of real world problems, and their… …   Wikipedia

  • Discrete and Computational Geometry — Discrete Computational Geometry   …   Wikipedia

  • Discharging method (discrete mathematics) — The discharging method is a technique used to prove lemmas in structural graph theory. Discharging is most well known for its central role in the proof of the Four Color Theorem. The discharging method is used to prove that every graph in a… …   Wikipedia

  • Discrete tomography — A discrete tomography reconstruction problem for two vertical and horizontal directions (left), together with its (non unique) solution (right). The task is to color some of the white points black so that the number of black points in the rows… …   Wikipedia

  • Mathematics — Maths and Math redirect here. For other uses see Mathematics (disambiguation) and Math (disambiguation). Euclid, Greek mathematician, 3r …   Wikipedia

  • Mathematics in medieval Islam — A page from the The Compendious Book on Calculation by Completion and Balancing by Al Khwarizmi. In the history of mathematics, mathematics in medieval Islam, often termed Islamic mathematics …   Wikipedia

  • Discrete Poisson equation — In mathematics, the discrete Poisson equation is the finite difference analog of the Poisson equation. In it, the discrete Laplace operator takes the place of the Laplace operator. The discrete Poisson equation is frequently used in numerical… …   Wikipedia

  • mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… …   Universalium

  • Outline of mathematics — Mathematics topics Mathematics articles: 0 9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Mathematicians: A B C D E F G H I J K L M N O P Q R S T U V …   Wikipedia

  • Discrete logarithm — In mathematics, specifically in abstract algebra and its applications, discrete logarithms are group theoretic analogues of ordinary logarithms. In particular, an ordinary logarithm loga(b) is a solution of the equation ax = b over the… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”