Journal of Combinatorics

10 papers10 directions
The Journal of Combinatorics is a research publication focused on the study of discrete structures, with an active presence in the scientific literature from 2010 through 2023. While primarily a mathematical venue, it serves the machine learning and artificial intelligence communities by providing theoretical foundations in graph theory, extremal combinatorics, and probabilistic methods. Its content often bridges the gap between pure mathematical inquiry and applied computational problems, particularly those involving complex networks and large-scale data structures. Research published in this venue frequently addresses structural properties that are central to modern AI, such as Graphon Neural Networks for transferable learning and the structural robustness of graph-based models. Specific areas of focus include the concentration of measure in large random graphs, structural mining in probabilistic graphs, and the application of the Lovász Local Lemma to avoid unfavorable outcomes in algorithmic processes. The journal also explores topics relevant to distributed systems, such as federated learning on fragmented graphs and phase transitions in extremal structures. Contributions to the journal often involve rigorous analysis of chromatic numbers, clique identification in random subgraphs, and the resolution of conjectures in extremal combinatorics. Prolific contributors such as Sinan G. Aksoy, Stephen J. Young, and Carlos Ortiz Marrero provide work that informs the development of graph algorithms and the understanding of computational hardness. By hosting discussions on open problems in applied combinatorics, the venue facilitates the development of mathematical frameworks necessary for advancing structural and relational machine learning.

Papers by Year

2023 1
2021 1
2018 1
2017 1
2016 3
2011 2
2010 1

Top Research Directions

Research directions most represented by papers from this venue.

The Discharging Method for Structural Graph Analysis 1
Unique Vertex Identification in Graphs 1
Exploiting Topological Sparsity in Planar Graphs 1
Non-Constructive Existence via the Probabilistic Method 1
Overcoming Dependencies in Probabilistic Existence Proofs 1
Proving Algorithmic Optimality via Complexity Conjectures 1
Structural Proofs via Minimal Counterexample Analysis 1
How Network Topology Governs Decentralized Learning Convergence 1
Overcoming the Dense Graph Assumption in Graph Learning 1
Scaling Topological Data Analysis for Deep Learning 1

Top Authors

AuthorPapers
Florent Foucaud1
Yulia Gel1

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Papers

TitleYear
Seven open problems in applied combinatorics2023
The slow-coloring game on sparse graphs: $k$-degenerate, planar, and outerplanar2021
Many cliques in $H$-free subgraphs of random graphs2018
Cycle double covers and long circuits of graphs2017
Induced forests in bipartite planar graphs2016
Problems and results in Extremal Combinatorics – III2016
Random subgraphs make identification affordable2016
Local rainbow colorings2011
The Erdös-Lovász Tihany conjecture and complete minors2011
Increasing the chromatic number of a random graph2010