🔮
🔮
The Ethereal
🏛️ 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
Polynomial Cases for the Vertex Coloring Problem
🔮
🔮
The Ethereal
Uniform generation of random graphs with power-law degree sequences
🔮
🔮
The Ethereal
Accounting for the Role of Long Walks on Networks via a New Matrix Function
🔮
🔮
The Ethereal
Doubly transitive lines I: Higman pairs and roux
🔮
🔮
The Ethereal
Certifying coloring algorithms for graphs without long induced paths
🔮
🔮
The Ethereal
Some restrictions on weight enumerators of singly even self-dual codes II
🔮
🔮
The Ethereal
Homomorphism bounds and edge-colourings of $K_4$-minor-free graphs
🔮
🔮
The Ethereal
The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations
🔮
🔮
The Ethereal
An explicit two-source extractor with min-entropy rate near 4/9
🔮
🔮
The Ethereal
Quadratic and symmetric bilinear forms over finite fields and their association schemes
🔮
🔮
The Ethereal
[1, 2]-sets and [1, 2]-total Sets in Trees with Algorithms
🔮
🔮
The Ethereal
Independent sets and cuts in large-girth regular graphs
🔮
🔮
The Ethereal
Eigenvalue Bounds for Sum-Rank-Metric Codes
🔮
🔮
The Ethereal
Strong blocking sets and minimal codes from expander graphs
🔮
🔮
The Ethereal
On cutting blocking sets and their codes
🔮
🔮
The Ethereal
Weight recursions for any rotation symmetric Boolean functions
🔮
🔮
The Ethereal
Tangles and the Mona Lisa
🔮
🔮
The Ethereal
Zero-free regions of partition functions with applications to algorithms and graph limits
🔮
🔮
The Ethereal
Constructing Near Spanning Trees with Few Local Inspections
🔮
🔮
The Ethereal
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
🔮
🔮
The Ethereal
Mutual visibility in hypercube-like graphs
🔮
🔮
The Ethereal
Using a geometric lens to find k disjoint shortest paths
🔮
🔮
The Ethereal