
Academic Journal
Q1Combinatorica
About Combinatorica
About Combinatorica
Combinatorica is a peer-reviewed scholarly journal published by Janos Bolyai Mathematical Society (Germany). It focuses on Q1. Publication coverage spans 1981-2026.
Key indicators: ISSN 0209-9683, 1439-6912; H-index 64.
Understanding This Journal's Metrics
Journal metrics help researchers assess fit, but they must be interpreted in context:
- H-index (64): Strong citation impact — 64 articles cited at least 64 times each, reflecting solid influence.
Publishing in Combinatorica
An established venue in its field. The journal welcomes solid, well-executed research. Ensure your manuscript fits the stated scope and follows author guidelines carefully.
- Scope fit: Confirm your research aligns with Q1. Off-scope manuscripts are typically desk-rejected quickly.
- Author guidelines: Follow formatting, reference style, and article-type requirements exactly — non-compliant manuscripts may be returned without review.
- Submission: Submit via the official journal website.
Is This Journal Right for Your Paper?
- Audience match: Will the journal's readers cite and build on your findings?
- Timeline: Higher-tier journals mean longer review and higher rejection risk. Balance prestige against your schedule.
- Indexing: Confirm indexing in Web of Science, Scopus, and PubMed (if biomedical) meets your institutional requirements.
- Open access needs: Check funder mandates and whether the journal offers compliant OA options.
Frequently Asked Questions
What is the ISSN of Combinatorica?
0209-9683, 1439-6912.
Who publishes Combinatorica?
Janos Bolyai Mathematical Society.
What are Combinatorica's metrics?
H-index 64.
Where do I submit to Combinatorica?
Via the official website.
Is Combinatorica peer-reviewed?
Yes — it is a peer-reviewed scholarly journal indexed in major academic databases.
Source-backed journal facts
Topics in published research
Advanced Graph Theory Research; Limits and Structures in Graph Theory; graph theory and CDMA systems; Graph theory and applications; Graph Labeling and Dimension Problems; Complexity and Algorithms in Graphs.
OpenAlex classifies topics from published works. These topics are not the publisher’s official aims and scope.
Reported open-access list prices
3,290.00 USD; 2,790.00 EUR; 2,390.00 GBP
APC list prices reported by OpenAlex, which obtains this information from DOAJ. Confirm current charges, taxes, waivers and eligibility with the publisher; this is not a fee quotation.
Source: OpenAlex source record. Retrieved 2026-10-03. Source record updated 2026-10-02. OpenAlex metrics are different from SCImago metrics and the Clarivate Journal Impact Factor.
Journal Metrics
Quartile, SJR and the listed SCImago H-index use the 2025 imported SCImago dataset. A quartile may vary by subject category. Values without a source or reporting year are unverified historical entries. Verify the current Journal Impact Factor with Clarivate or the publisher before using it.
Aims & Scope
The publisher’s official aims and scope have not yet been verified for this profile. Use the journal website to check subject fit and accepted article types before submitting.
Recent Research Articles
Latest publications matched automatically by ISSN.
A Polynomial Improvement for the Odd Cycle–Complete Ramsey Numbers
Marcelo Campos, Matthew Jenssen, Marcus Michelen, Florian Pfender et al.
2026-10 · DOI: 10.1007/s00493-026-00226-xMultisets Meeting Lines in 0 Modulo p Points and an Improvement of the Bagchi-Inamdar Bound
Bence Csajbók, Giovanni Longobardi, Giuseppe Marino, Rocco Trombetti et al.
2026-10 · DOI: 10.1007/s00493-026-00225-yConnected Fair Detachments of Hypergraphs I
Amin Bahmanian
2026-10 · DOI: 10.1007/s00493-026-00224-zSunflowers and Ramsey Problems for Restricted Intersections
Barnabás Janzer, Zhihan Jin, Benny Sudakov, Kewen Wu et al.
2026-08 · DOI: 10.1007/s00493-026-00222-1Ordered Ramsey Numbers of Powers of Paths
António Girão, Barnabás Janzer, Oliver Janzer
2026-08 · DOI: 10.1007/s00493-026-00223-0The fractional Helly number for separable convexity spaces
Andreas F. Holmsen, Zuzana Patáková
2026-08 · DOI: 10.1007/s00493-026-00221-2A Counterexample to a Conjecture of Lovász
Alexander Clow, Penny Haxell, Bojan Mohar
2026-08 · DOI: 10.1007/s00493-026-00220-3Matroids are Equitable
Hannaneh Akrami, Siyue Liu, Roshan Raj, László A. Végh et al.
2026-06 · DOI: 10.1007/s00493-026-00217-yVolume Rigidity of Simplicial Manifolds
James Cruickshank, Bill Jackson, Shin-ichi Tanigawa
2026-06 · DOI: 10.1007/s00493-026-00218-xTowards an Optimal Hypergraph Container Lemma
Marcelo Campos, Wojciech Samotij
2026-06 · DOI: 10.1007/s00493-026-00214-1Tight Colorful No-Dimensional Tverberg Theorem
Polina Barabanshchikova, Grigory Ivanov, Alexander Polyanskii
2026-06 · DOI: 10.1007/s00493-026-00219-wTangle-tree duality in infinite graphs
Sandra Albrechtsen
2026-06 · DOI: 10.1007/s00493-026-00210-5A Universal Threshold for Geometric Embeddings of Trees
Dylan J. Altschuler, Pandelis Dodos, Konstantin Tikhomirov, Konstantinos Tyros et al.
2026-06 · DOI: 10.1007/s00493-026-00216-zTwo Disjoint Alternating Paths in Bipartite Graphs: Conformal Crosses
Archontia C. Giannopoulou, Sebastian Wiederrecht
2026-06 · DOI: 10.1007/s00493-026-00211-4Exact Results on Traces of Sets
Mingze Li, Jie Ma, Mingyuan Rong
2026-06 · DOI: 10.1007/s00493-026-00209-yExplosive appearance of cores and bootstrap percolation on lattices
Ivailo Hartarsky, Lyuben Lichev
2026-06 · DOI: 10.1007/s00493-026-00213-2The Classification of Homomorphism Homogeneous Oriented Graphs
Bojana Pavlica, Christian Pech, Maja Pech
2026-04 · DOI: 10.1007/s00493-026-00206-1Rigidity Matroids and Linear Algebraic Matroids with Applications to Matrix Completion and Tensor Codes
Joshua Brakensiek, Manik Dhar, Jiyang Gao, Sivakanth Gopi et al.
2026-04 · DOI: 10.1007/s00493-026-00208-zExplicit Constructions of Optimal Blocking Sets and Minimal Codes
Anurag Bishnoi, István Tomon
2026-04 · DOI: 10.1007/s00493-026-00202-5Modified Macdonald Polynomials and $$\mu $$-Mahonian Statistics
Emma Yu Jin, Xiaowei Lin
2026-04 · DOI: 10.1007/s00493-026-00204-3Reviews
Community Reviews
Version History
October 9, 2026 at 7:16 pm
September 25, 2026