Journal of Combinatorics 2016

3 papers
The 2016 volume of the Journal of Combinatorics featured research centered on extremal combinatorics and graph theory. A significant methodological focus during this year was the application of the Lovász Local Lemma to avoid bad events in probabilistic structures. Specific studies investigated the efficiency of random subgraphs in identification problems and the characteristics of induced forests within bipartite planar graphs. The edition included the third part of a series detailing problems and results in extremal combinatorics. Key contributors to the year's publications included Florent Foucaud, Guillem Perarnau, Oriol Serra, Qiqin Xie, and Xingxing Yu. These works collectively advanced the understanding of structural properties in graphs and the use of probabilistic methods to solve combinatorial challenges. The research published during this period reflects a continued interest in the intersection of probability and discrete mathematics.

Top Research Directions

The 3 research directions with Journal of Combinatorics 2016 papers, ranked by paper count, next to 2011. Share is the fraction of the edition’s papers in the direction.

#Direction20162011Share 2016Share 20112011 rank
1Exploiting Topological Sparsity in Planar Graphs1033.3%0.0%—
2Non-Constructive Existence via the Probabilistic Method1033.3%0.0%—
3The Discharging Method for Structural Graph Analysis1033.3%0.0%—

Download all directions as CSV

Institutions

Institutions credited by Journal of Combinatorics 2016 papers: a paper credits every institution named in its affiliations, once. 1 institutions share 1 credited papers.

#InstitutionPapersShare
1Georgia Institute of Technology 1100.0%

Download all institutions as CSV

About this data

Papers. Journal of Combinatorics 2016 lists 3 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.

Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers. Comparisons with 2011 use shares, since the edition went from 2 to 3 papers.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 1 of 3 papers (33.3%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.

Data. Counts come from Lacuna’s data build of 2026-11-19 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “Journal of Combinatorics 2016”, https://lacuna.tiptreesystems.com/venue/journal-of-combinatorics/2016.

Top Authors

AuthorPapers
Florent Foucaud1

Papers

Title
Induced forests in bipartite planar graphs
Problems and results in Extremal Combinatorics – III
Random subgraphs make identification affordable