World's Best Scientists 2026 revealed!
The Journal of Combinatorics
H-index 4

The Journal of Combinatorics

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Mathematics 573 13 15 4
Computer Science 997 8 7 3

Additional Metrics

Number of Best Scientists*: 18
Documents by Best Scientists*: 19
Top 100 Ranked Scientists*: 1
SCIMAGO H-index:
SCIMAGO SJR:
Impact Factor: 0.4

Overview

Top Research Topics at The Journal of Combinatorics?

The Journal of Combinatorics explores disciplines such as Combinatorics, Discrete mathematics, Graph, Conjecture and Order (group theory). The Journal of Combinatorics dives deep in exploring the relationship between the study of Combinatorics and Upper and lower bounds. Vertex (graph theory), Symmetric graph, Vertex-transitive graph, 1-planar graph and Bipartite graph are among the concentrations of Discrete mathematics that garnered much attention in The Journal of Combinatorics.

The majority of Matroid studies in The Journal of Combinatorics are focused on the subject of Graphic matroid. Matroid partitioning is a focus of the presented Graphic matroid works and it dives deep in Matroid partitioning. The research on Chordal graph discussed in the journal draws on the closely related field of Pathwidth.

  • Combinatorics (98.57%)
  • Discrete mathematics (58.33%)
  • Graph (12.15%)

What are the most cited papers published in the journal?

  • P.L. Homeomorphic Manifolds are Equivalent by Elementary Shellings (349 citations)
  • The Complete Intersection Theorem for Systems of Finite Sets (322 citations)
  • Chip-firing games on graphs (210 citations)

Research areas of the most cited articles at The Journal of Combinatorics:

The most cited publications explore disciplines such as Combinatorics, Discrete mathematics, Graph, Indifference graph and Chordal graph. The most cited articles primarily discuss Combinatorics topics, particularly Conjecture, 1-planar graph, Pathwidth, Permutation and Vertex (graph theory). The most cited articles focus on different Discrete mathematics studies like Vertex-transitive graph, Symmetric graph, Graph power, Cograph and Line graph.

What topics the last edition of the journal is best known for?

  • Combinatorics
  • Geometry
  • Algebra

The previous edition focused in particular on these issues:

The primary areas of discussion in The Journal of Combinatorics are Combinatorics, Permutation, Hypergraph, Random graph and Structure (category theory). Some problems in Combinatorics that were presented in it overlapped with concepts under Vector space and Upper and lower bounds. While Permutation is the focus of it, it also provided insights into the studies of Image (category theory), Interval (mathematics) and Product (mathematics).

The work on Random graph tackled in the journal brings together disciplines like Poisson distribution, Affine transformation, Scale (descriptive set theory) and Finite field. The research on Structure (category theory) tackled can also make contributions to studies in the areas of Representation (mathematics), Poset topology, Type (model theory) and Möbius function. The Journal of Combinatorics explores issues in Conjecture which can be linked to other research areas like Ramsey's theorem, Bipartite graph and Constant (mathematics).

The most cited articles from the last journal are:

  • Partite Turán-densities for complete $r$-uniform hypergraphs on $r+1$ vertices (1 citations)
  • A $2$-regular graph has a prime labeling if and only if it has at most one odd component (0 citations)
  • Avoiding long Berge cycles II, exact bounds for all $n$ (0 citations)

Papers citation over time

A key indicator for each journal is its effectiveness in reaching other researchers with the papers published at that venue.

The chart below presents the interquartile range (first quartile 25%, median 50% and third quartile 75%) of the number of citations of articles over time.

The top authors publishing in The Journal of Combinatorics (based on the number of publications) are:

  • Jaroslav Nešetřil (26 papers) absent at the last edition,
  • Satoshi Yoshiara (17 papers) absent at the last edition,
  • James Oxley (17 papers) absent at the last edition,
  • Antonio Pasini (16 papers) absent at the last edition,
  • Béla Bollobás (16 papers) absent at the last edition.

The overall trend for top authors publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top authors.

Only papers with recognized affiliations are considered

The top affiliations publishing in The Journal of Combinatorics (based on the number of publications) are:

  • Charles University in Prague (86 papers) absent at the last edition,
  • University of Ljubljana (62 papers) absent at the last edition,
  • Ghent University (53 papers) absent at the last edition,
  • Centre national de la recherche scientifique (42 papers) absent at the last edition,
  • Massachusetts Institute of Technology (37 papers) published 1 paper at the last edition, 2 less than at the previous edition.

The overall trend for top affiliations publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top affiliations.

Publication chance based on affiliation

The publication chance index shows the ratio of articles published by the best research institutions in the journal edition to all articles published within that journal. The best research institutions were selected based on the largest number of articles published during all editions of the journal.

The chart below presents the percentage ratio of articles from top institutions (based on their ranking of total papers).Top affiliations were grouped by their rank into the following tiers: top 1-10, top 11-20, top 21-50, and top 51+. Only articles with a recognized affiliation are considered.

During the most recent 2021 edition, 12.50% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 35.71% were posted by at least one author from the top 10 institutions publishing in the journal. Another 0.00% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 7.14% of all publications and 57.14% were from other institutions.

Returning Authors Index

A very common phenomenon observed among researchers publishing scientific articles is the intentional selection of journals they have already attended in the past. In particular, it is worth analyzing the case when the authors participate in the same journal from year to year.

The Returning Authors Index presented below illustrates the ratio of authors who participated in both a given as well as the previous edition of the journal in relation to all participants in a given year.

Returning Institution Index

The graph below shows the Returning Institution Index, illustrating the ratio of institutions that participated in both a given and the previous edition of the conference in relation to all affiliations present in a given year.

The experience to innovation index

Our experience to innovation index was created to show a cross-section of the experience level of authors publishing in a journal. The index includes the authors publishing at the last edition of a journal, grouped by total number of publications throughout their academic career (P) and the total number of citations of these publications ever received (C).

The group intervals were selected empirically to best show the diversity of the authors' experiences, their labels were selected as a convenience, not as judgment. The authors were divided into the following groups:

  • Novice - P < 5 or C < 25 (the number of publications less than 5 or the number of citations less than 25),
  • Competent - P < 10 or C < 100 (the number of publications less than 10 or the number of citations less than 100),
  • Experienced - P < 25 or C < 625 (the number of publications less than 25 or the number of citations less than 625),
  • Master - P < 50 or C < 2500 (the number of publications less than 50 or the number of citations less than 2500),
  • Star - P ≥ 50 and C ≥ 2500 (both the number of publications greater than 50 and the number of citations greater than 2500).

The chart below illustrates experience levels of first authors in cases of publications with multiple authors.

Top Publications

  • Gamma-positivity of variations of Eulerian polynomials

    John Shareshian;Michelle L. Wachs

    (2020)
    25 Citations
  • Topological directions in Cops and Robbers

    Anthony Bonato;Bojan Mohar

    (2020)
    18 Citations
  • Avoiding long Berge cycles II, exact bounds for all $n$

    Zoltán Füredi;Alexandr Kostochka;Ruth Luo

    (2021)
    16 Citations
  • Classification of lattice polytopes with small volumes

    Takayuki Hibi;Akiyoshi Tsuchiya

    (2020)
    9 Citations
  • On enumerators of smirnov words by descents and cyclic descents

    Brittneyz Ellzey;Michelle L. Wachs

    (2020)
    4 Citations
  • Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs

    Louis DeBiasio;András Gyárfás;Robert A. Krueger;Miklós Ruszinkó

    (2020)
    3 Citations
  • A generalization of a 1998 unimodality conjecture of Reiner and Stanton

    Richard P. Stanley;Fabrizio Zanello

    (2020)
    3 Citations
  • The chromatic number of squares of random graphs

    (2023)
    3 Citations

Related Online Degrees & Career Pathways

Choosing the right online degree in computer science can significantly impact your career trajectory. Many students look for programs that not only offer strong technical training but also lead to high earning potential. Exploring the most profitable majors helps you identify areas within computer science that are in demand and financially rewarding.

Budget is often a key consideration when pursuing an online degree. Fortunately, there are numerous affordable options available. Discovering cheap online universities enables students to reduce tuition costs without sacrificing educational quality.

Streamlining the application process can also make a big difference. Many reputable schools today waive application fees, making it easier and less expensive to apply. Researching online schools no application fee can help you avoid unnecessary expenses and speed up your enrollment journey.

For those eager to enter the workforce quickly, fast track programs offer accelerated pathways to earning your degree. These options are ideal for motivated learners who want to gain skills and credentials in a shorter timeframe, enhancing career readiness.

Best Scientists Contributing to This Journal