Journal of Combinatorial Theory

The Journal of Combinatorial Theory, Series A[1] and Series B,[2] are mathematical journals specializing in combinatorics and related areas. They are published by Elsevier. Series A is concerned primarily with structures, designs, and applications of combinatorics. Series B is concerned primarily with graph and matroid theory. The two series are two of the leading journals in the field and are widely known as JCTA and JCTB.[citation needed]

Journal of Combinatorial Theory
Publication details
Standard abbreviations
ISO 4J. Comb. Theory
MathSciNetJ. Combin. Theory
Series A
Series B

The journal was founded in 1966 by Frank Harary and Gian-Carlo Rota.[3] Originally there was only one journal, which was split into two parts in 1971 as the field grew rapidly.

An electronic, open access journal, Combinatorial Theory,[4] was announced in 2020, that aims to be a continuation of JCTA independently from Elsevier. Most of the editorial board of JCTA resigned at the end of 2020 and part of them transitioned to Combinatorial Theory.[5][6][7] It published it first issue in December 2021[8]

Influential articlesEdit

Influential articles that appeared in the journal include Katona's elegant proof[9] of the Erdős–Ko–Rado theorem and a series of papers spanning over 500 pages, appearing from 1983[10] to 2004,[11] by Neil Robertson and Paul D. Seymour on the topic of graph minors, which together constitute the proof of the graph minor theorem. Two articles proving Kneser's conjecture,[12][13] the first by László Lovász and the other by Imre Bárány appeared back-to-back in the same issue of the journal.


  1. ^ Journal of Combinatorial Theory, Series A - Elsevier
  2. ^ Journal of Combinatorial Theory, Series B - Elsevier
  3. ^ They are acknowledged on the journals' title pages and Web sites. See Editorial board of JCTA; Editorial board of JCTB.
  4. ^ "Combinatorial Theory". Retrieved 2020-09-14.
  5. ^ "Another mass resignation of an editorial board has happened". Twitter. Retrieved 2020-09-14.
  6. ^ "Combinatorial Theory: a new mathematician-owned and fully open access journal".
  7. ^ "Website of the new journal".
  8. ^ Editorial Team, Combinatorial Theory (2021-12-09). "Editorial". Combinatorial Theory. 1. doi:10.5070/C61055307. ISSN 2766-1334. S2CID 245076810.
  9. ^ Katona, G.O.H. (1972), "A simple proof of the Erdös-Chao Ko-Rado theorem", Journal of Combinatorial Theory, Series B, 13 (2): 183–184, doi:10.1016/0095-8956(72)90054-8
  10. ^ Robertson, Neil; P.D. Seymour (1983), "Graph Minors. I. Excluding a forest", Journal of Combinatorial Theory, Series B, 35 (1): 39–61, doi:10.1016/0095-8956(83)90079-5
  11. ^ Robertson, Neil; P.D. Seymour (2004), "Graph Minors. XX. Wagner's conjecture", Journal of Combinatorial Theory, Series B, 92 (2): 325–357, doi:10.1016/j.jctb.2004.08.001
  12. ^ Lovász, László (1978), "Kneser's conjecture, chromatic number, and homotopy", Journal of Combinatorial Theory, Series A, 25 (3): 319–324, doi:10.1016/0097-3165(78)90022-5
  13. ^ Bárány, Imre (1978), "A short proof of Kneser's conjecture", Journal of Combinatorial Theory, Series A, 25 (3): 325–326, doi:10.1016/0097-3165(78)90023-7