Combinatorics & discrete mathematics
4,014 studies198 in 7 days1,616 in 30 days
Filters
Latest
4,014 studies
- Kobayashi's problem for power semigroups of inverse semigroups
- Avoiding two cycles in Avoider--Enforcer games
- An Exact 93-Move Solution to a Nonlocal Crystal-Exchange Puzzle
- An entropy proof of the commonality of apices of trees
- Counting and constructing Latin tableaux
- A proof of Ward's conjecture on Griesmer codes
- Third and Fourth Moment Phenomena for Monochromatic Edges and Applications to Graph-Based Two-Sample Tests
- The Local Dyadic Conjecture
- Small covers and the Four Color Theorem
- Integer Flows on Cyclic Covers of Graphs
- On a conjecture concerning two-stack sortable permutations
- Pappus configurations in the Hall plane
- General Criterion for a Poset to Admit a Partition Into ω-Chains
- Proofs of Li, Wang and Guo's conjectures on (signless) Laplacian spectral radius
- Non-trivial intersecting families for direct products
- Every tournament of dichromatic number 10 k2 has a vertex whose out-neighborhood has dichromatic number more than k
- On the Number of Iterations in a Kruskal-Type Process
- Affine G-multibiquandle modules for colored links I: representability of coloring functors and color-profile polynomials
- Local Extrema and Infinite Derivatives of the Delange Function of Base 3
- $2$-large sets are sets of nil-Bohr recurrence
- Distinguishing graphs with simple spectrum by homomorphism counts
- Rank-sensitive vertex bounds for semidefinite lifts
- Non-freezing of the proximity digraph and non-pseudostable convergence in heterogeneous Hegselmann--Krause models: Counterexamples to conjectures and results of Mirtabatabaei and Bullo
- Resilience of rainbow Hamilton cycles in pseudorandom graphs
- A solution to a conjecture on the signless Laplacian spectral radius for t-color-critical graphs