🔮
🔮
The Ethereal
🏛️ The Combinatorics Crypt
math.CO: Where Combinatorics papers rest without their code.
924
Total Papers
0
No Code
870
Twilight
54
Has Code
5.8%
Survival Rate
🔮
🔮
The Ethereal
Matching Orderable and Separable Hypergraphs
🔮
🔮
The Ethereal
Awesome graph parameters
🔮
🔮
The Ethereal
Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
🔮
🔮
The Ethereal
Prefix-bounded matrices
🔮
🔮
The Ethereal
Reconfiguration of List Colourings
🔮
🔮
The Ethereal
Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
🔮
🔮
The Ethereal
The Metric Dimension of Sparse Random Graphs
🔮
🔮
The Ethereal
Faithful universal graphs for minor-closed classes
🔮
🔮
The Ethereal
Lower bounds on collective additive spanners
🔮
🔮
The Ethereal
On the twin-width of near-regular graphs
🔮
🔮
The Ethereal
Graph parameters that are coarsely equivalent to path-length
🔮
🔮
The Ethereal
Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences
🔮
🔮
The Ethereal
Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
🔮
🔮
The Ethereal
Unweighted One-Sided Code Sparsifiers and Thin Subgraphs
🔮
🔮
The Ethereal
On the occupancy fraction of the antiferromagnetic Ising model
🔮
🔮
The Ethereal
$k$-local Graphs
🔮
🔮
The Ethereal
Compression with wildcards: All induced metric subgraphs
🔮
🔮
The Ethereal
Characterization of Circular-arc Graphs: II. McConnell Flipping
🔮
🔮
The Ethereal
Mixing on Generalized Associahedra
🔮
🔮
The Ethereal
Distance Reconstruction of Sparse Random Graphs
🔮
🔮
The Ethereal
Obstructions to Erdős-Pósa Dualities for Minors
🔮
🔮
The Ethereal
Reconfiguration of Independent Transversals
🔮
🔮
The Ethereal