🏛️ The Combinatorics Crypt
math.CO: Where Combinatorics papers rest without their code.
910
Total Papers
0
No Code
870
Twilight
40
Has Code
4.4%
Survival Rate
🔮
🔮
The Ethereal
🔮
🔮
The Ethereal
A Practical Algorithm for the Computation of the Genus
🔮
🔮
The Ethereal
On Efficient Distance Approximation for Graph Properties
🔮
🔮
The Ethereal
Improved Bounds for $(b,k)$-hashing
🔮
🔮
The Ethereal
The star-structure connectivity and star-substructure connectivity of hypercubes and folded hypercubes
🔮
🔮
The Ethereal
Rotational analysis of ChaCha permutation
🔮
🔮
The Ethereal
An Improved Linear Programming Bound on the Average Distance of a Binary Code
🔮
🔮
The Ethereal
Probabilistic refinement of the asymptotic spectrum of graphs
🔮
🔮
The Ethereal
A Combinatorial-Probabilistic Analysis of Bitcoin Attacks
🔮
🔮
The Ethereal
Distributed coloring of graphs with an optimal number of colors
🔮
🔮
The Ethereal
Approximating real-rooted and stable polynomials, with combinatorial applications
🔮
🔮
The Ethereal
The rank of random matrices over finite fields
🔮
🔮
The Ethereal
Reed-Solomon codes over small fields with constrained generator matrices
🔮
🔮
The Ethereal
An Assmus-Mattson Theorem for Rank Metric Codes
🔮
🔮
The Ethereal
New Lower Bounds for Permutation Arrays Using Contraction
🔮
🔮
The Ethereal
Topology of Privacy: Lattice Structures and Information Bubbles for Inference and Obfuscation
🔮
🔮
The Ethereal
Estimating parameters associated with monotone properties
🔮
🔮
The Ethereal
Uniquely restricted matchings and edge colorings
🔮
🔮
The Ethereal
Explicit Lossless Vertex Expanders
🔮
🔮
The Ethereal
Graph classes through the lens of logic
🔮
🔮
The Ethereal
Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
🔮
🔮
The Ethereal
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
🔮
🔮
The Ethereal
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem
🔮
🔮
The Ethereal