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.

Journal of Combinatorial Theory
DisciplineMathematics
LanguageEnglish
Publication details
History1966-present
Publisher
FrequencyMonthly
Standard abbreviations
ISO 4J. Comb. Theory
MathSciNetJ. Combin. Theory
Indexing
Series A
ISSN0097-3165
Series B
ISSN0095-8956
Links

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.

Influential articles

Influential articles that appeared in the journal include Katona's elegant proof[4] of the Erdős–Ko–Rado theorem and a series of papers spanning over 500 pages, appearing from 1983[5] to 2004,[6] 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,[7][8] 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.

gollark: <@229624651314233346> Not much of a difference.
gollark: 🇮 🇭 🇦 🇻 🇪 🇦 🇸 🇨 🇷 🇮 🇵 🇹 🇮 🇳 🇭 🇦 🇸 🇰 🇪 🇱 🇱 🇫 🇴 🇷 🇬 🇪 🇳 🇪 🇷 🇦 🇹 🇮 🇳 🇬 🇹 🇭 🇮 🇸 🇧 🇮 🇬 🇹 🇪 🇽 🇹 ;🇮 🇹 🇮 🇸 🇺 🇸 🇪 🇫 🇺 🇱 .
gollark: 🇹 🇭 🇦 🇹 🇹 🇴 🇴
gollark: AND IN 1-3 YEARS THAT STUFF WILL BE OBSOLETED.
gollark: INTENSE USELESSNESS.

References
  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. 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
  5. 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
  6. 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
  7. 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
  8. 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
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.