🔮
🔮
The Ethereal
🏛️ The Combinatorics Crypt
math.CO: Where Combinatorics papers rest without their code.
929
Total Papers
0
No Code
870
Twilight
59
Has Code
6.4%
Survival Rate
🔮
🔮
The Ethereal
Edge-Cuts and Rooted Spanning Trees
🔮
🔮
The Ethereal
A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees
🔮
🔮
The Ethereal
Determinants from homomorphisms
🔮
🔮
The Ethereal
Enumeration of chordal planar graphs and maps
🔮
🔮
The Ethereal
Isomorphism testing of $k$-spanning tournaments is Fixed Parameter Tractable
🔮
🔮
The Ethereal
Millions of inequivalent quadratic APN functions in eight variables
🔮
🔮
The Ethereal
Optimal and Efficient Partite Decompositions of Hypergraphs
🔮
🔮
The Ethereal
Graph Classes Closed under Self-intersection
🔮
🔮
The Ethereal
The Strong Birthday Problem Revisited
🔮
🔮
The Ethereal
A Freeable Matrix Characterization of Bipartite Graphs of Ferrers Dimension Three
🔮
🔮
The Ethereal
Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs
🔮
🔮
The Ethereal
Trickle-down Theorems via C-Lorentzian Polynomials II: Pairwise Spectral Influence and Improved Dobrushin's Condition
🔮
🔮
The Ethereal
Liar's vertex-edge domination in unit disk graph
🔮
🔮
The Ethereal
Separable convex optimization over indegree polytopes
🔮
🔮
The Ethereal
Vertex-ordering and arc-partitioning problems
🔮
🔮
The Ethereal
Dvorak-Dell-Grohe-Rattan theorem via an asymptotic argument
🔮
🔮
The Ethereal
Kernelization for list $H$-coloring for graphs with small vertex cover
🔮
🔮
The Ethereal
Finding a solution to the Erdős-Ginzburg-Ziv theorem in $O(n\log\log\log n)$ time
🔮
🔮
The Ethereal
Liar's vertex-edge domination in subclasses of chordal graphs
🔮
🔮
The Ethereal
Cover time of random subgraphs of the hypercube
🔮
🔮
The Ethereal
Pathographs and some (un)decidability results
🔮
🔮
The Ethereal
The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
🔮
🔮
The Ethereal