Combinatorics & discrete mathematics
4,167 studies349 in 7 days1,768 in 30 days
Filters
Latest
4,167 studies
- On union-closed families with prescribed number of k-sets
- Polynomial positivity cones for Coxeter roots and walks in trees
- Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor
- Quadruples and cubes
- Polyhedral Geometry of Time-to-First-Spike Neural Networks
- Vector Balancing via Directional Total Variation
- A deterministic (1+ε)n approximation for the permanent of a nonnegative matrix
- Counting Near-Spanning Matchings in Latin Squares and Steiner Triple Systems
- The q-deformed cross-ratio: modular invariants and Coxeter friezes
- Erdős-Sós for digraphs
- Balanced even cycles in signed graphs:Turán bounds, double covers, and parity obstructions
- Almost Linear Universal Point Sets for Planar Graphs
- When chromatic polynomials coincide with list-color functions: a threshold linear in the maximum degree
- The cyclic-induction Schur cone: Boolean sums, Ramanujan-square positivity, and integral structure
- Iterating the Lehmer code on inversion sequences: Catalan fixed points and finite stabilization
- Richardson tableaux and Motzkin paths
- Asymptotically optimal bracketing covers for anchored boxes with applications to star discrepancy
- On the distinct maximal-clique sizes in k-uniform hypergraphs
- Multiparameter counting of numerical semigroups: recurrences and leaf-discriminating trees
- Recognizability equals CMSO-definability for graphs of rank-width at most two
- A Geometric Criterion for Degeneracy in the Elekes-Szabó Theorem
- The discrete homotopy hypothesis for directed graphs
- Improved Rate-versus-Distance Upper Bounds for LDPC Codes
- Functorial equivalence classes of 2-blocks of tame representation type
- A note on highly connected K2,ℓ -minor free graphs