Advances In Combinatorics
20 FOLLOWERS
Advances in Combinatorics is a mathematical journal that publishes high-quality articles about combinatorial structures such as graphs, hypergraphs, set systems, matroids, geometrical configurations, and sets of integers, including their algorithmic aspects. We aim to be a top-level specialist journal in combinatorics.
Advances In Combinatorics
5M ago
A proof of the finiteness of the set of excluded minors for the class of bicircular matroids, and a potential exhaustive list of such excluded minors ..read more
Advances In Combinatorics
6M ago
Every graph has a collection of linearly many paths separating any pair of edges ..read more
Advances In Combinatorics
8M ago
A detailed analysis of the overlap between random solutions of a random linear equation ..read more
Advances In Combinatorics
9M ago
A new proof of the Ramsey goodness of book graphs, with an improved dependence between the parameters ..read more
Advances In Combinatorics
9M ago
A minimum codegree condition for the existence of powers of tight Hamilton cycles in uniform hypergraphs ..read more
Advances In Combinatorics
10M ago
Construction of graphs with Ramsey multiplicity constant that can be determined exactly and is below the random coloring bound ..read more
Advances In Combinatorics
1y ago
An asymptotically tight threshold on n from which the Burr-Erdős-Spencer formula for the Ramsey number of n identical copies of the same graph applies ..read more
Advances In Combinatorics
1y ago
A unified "local" version of two classical theorems of Thomassen about list coloring in planar graphs is proved ..read more
Advances In Combinatorics
1y ago
A logarithmic bound on the tree-width of graphs from a family determined by forbidden induced subgraphs ..read more