🏛️ The Combinatorics Crypt
math.CO: Where Combinatorics papers rest without their code.
906
Total Papers
0
No Code
870
Twilight
36
Has Code
4.0%
Survival Rate
🔮
🔮
The Ethereal
🔮
🔮
The Ethereal
On construction and (non)existence of $c$-(almost) perfect nonlinear functions
🔮
🔮
The Ethereal
Scattered subspaces and related codes
🔮
🔮
The Ethereal
Uniform generation of random regular graphs
🔮
🔮
The Ethereal
Sparse universal graphs for planarity
🔮
🔮
The Ethereal
Three Combinatorial Perspectives on Minimal Codes
🔮
🔮
The Ethereal
Combinatorial Characterizations of Algebraic Manipulation Detection Codes Involving Generalized Difference Families
🔮
🔮
The Ethereal
On the classification of linear complementary dual codes
🔮
🔮
The Ethereal
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
🔮
🔮
The Ethereal
Planar Graphs that Need Four Pages
🔮
🔮
The Ethereal
MRD-codes arising from the trinomial $x^q+x^{q^3}+cx^{q^5}\in\mathbb{F}_{q^6}[x]$
🔮
🔮
The Ethereal
On an open problem about a class of optimal ternary cyclic codes
🔮
🔮
The Ethereal
Location of zeros for the partition function of the Ising model on bounded degree graphs
🔮
🔮
The Ethereal
Nearly orthogonal vectors and small antipodal spherical codes
🔮
🔮
The Ethereal
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
🔮
🔮
The Ethereal
Clique-Width for Hereditary Graph Classes
🔮
🔮
The Ethereal
Reticulation-visible networks
🔮
🔮
The Ethereal
Combining subspace codes
🔮
🔮
The Ethereal
Placement Delivery Arrays from Combinations of Strong Edge Colorings
🔮
🔮
The Ethereal
Flip-width: Cops and Robber on dense graphs
🔮
🔮
The Ethereal
The phases of large networks with edge and triangle constraints
🔮
🔮
The Ethereal
On the lengths of divisible codes
🔮
🔮
The Ethereal
Quantum Max-flow/Min-cut
🔮
🔮
The Ethereal