Journal of Combinatorial Theory Series B

13 papers9 directions
The Journal of Combinatorial Theory Series B is a long-standing publication focused on discrete mathematics, with activity in the research corpus spanning from 1987 to 2026. The venue primarily publishes work on graph theory, matroids, and combinatorial structures. While its core focus is mathematical, its relevance to the machine learning and artificial intelligence communities lies in the foundational theory it provides for network analysis, algorithmic complexity, and structured data representation. Research at this venue frequently addresses structural properties and conjectures within graph theory. Notable topics include the Kelmans-Seymour conjecture, Ramsey multiplicity, and the study of flows on signed graphs. Sample papers investigate universality for graphs with bounded density, cycle covers, and the properties of trees in tournaments. These contributions establish the theoretical limits and characteristics of discrete systems, which are essential for developing robust optimization techniques and graph-based learning algorithms. The journal features contributions from researchers such as Cun-Quan Zhang, Xingxing Yu, and Sebastian Pokutta. By documenting rigorous proofs regarding graph minors, subdivisions, and circuit decompositions, the venue supports the mathematical framework necessary for computational logic and relational modeling. Its role in the broader research landscape is to provide the formal results that underpin the design and analysis of complex discrete algorithms used in modern computational systems.

Papers by Year

2026 2
2024 1
2023 1
2022 1
2020 1
2019 1
2018 1
2015 1
2009 1
2008 3
1987 1

Top Research Directions

Research directions most represented by papers from this venue.

Structural Stability in Extremal Graph Theory 1
Structural Randomness Decomposition in Graphs 1
Tightening Extremal Bounds in Graph Combinatorics 1
Hierarchical Tree Embeddings for Metric Space Approximation 1
Overcoming Dependencies in Probabilistic Existence Proofs 1
Simplifying Complex Proofs for Mathematical Accessibility 1
Symmetry Reduction for High Dimensional Optimization 1
Decomposing Complex Graphs into Canonical Components 1
Node Embeddings via Random Walk Sequence Modeling 1

Top Authors

AuthorPapers
Alistair Benford2
Christoph Spiegel1
Rose McCarty1

Impactful Papers

Papers from this venue that shaped research clusters.

Influential

Papers

TitleYear
The four-color Ramsey multiplicity of triangles2026
Universality for graphs with bounded density2026
Trees with many leaves in tournaments2024
Trees with few leaves in tournaments2022
Flows on flow-admissible signed graphs2020
The Kelmans-Seymour conjecture III: 3-vertices in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:msubsup><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml2019
Cycle covers (III) – Compatible circuit decomposition and K5-transition minor2018
Subdivisions of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mm2015
Oriented diameter of graphs with diameter 32009
Linear connectivity forces large complete bipartite minors2008
Note on coloring graphs without odd-<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math>-min2008
Nowhere-zero 3-flows in triangularly connected graphs2008
Distance-regularised graphs are distance-regular or distance-biregular1987