Combinatorics & discrete mathematics
4,014 studies257 in 7 days1,648 in 30 days
Filters
Latest
4,014 studies
- Graphs with three distinct distance eigenvalues, one of which is zero
- The optimal four-dimensional lattice quantizer and bounds from Voronoi facets
- Comments on "Multidimensional Costas Arrays and Their Periodicity"
- Combinatorial Algorithms for Partial Inverse Min-Max Spanning Tree Problem under the Weighted Sum Hamming Distance
- Applying Changes to LDPC Codes by Using 3-Induced Matchings and Eigenvalues
- The covering radius of RM(1,9) is precisely 242
- SAWs, trails, kites, patterns
- Edge‐Coloring a Graph G so That Every Copy of a Graph H Has an Odd Color Class
- Tropical Regularity
- Graphical Analysis of Lifted Product Code Constructions
- Abelianization and moment maps
- Band Random Graphs: Connectivity, Geometry, and Transport
- On nowhere-zero 3-flows in Cayley graphs on groups of order p2n
- A Counterexample to the Alon-Krivelevich Conjecture and a New Lower Bound for Choosability of Bipartite Graphs
- Two choices suffice: k-out sampling leaves O(n/k) intercomponent edges for k≥ 2
- Berenstein-Zelevinsky polytopes for type G2
- Treedepth is NP-Hard on Planar Graphs of Maximum Degree 3
- Modulo k-orientations of highly edge-connected signed graphs
- Extremal character spectra of finite projective systems
- Tiling without a subspace complement: a sharp counterexample in dimension nine over the field with two elements
- Ramsey numbers R(K1,4,Km,n) for small m
- Suspense and surprise in matroid bingo
- Hilton-Zhao vertex-splitting conjecture for triangle-free graphs
- Hedetniemi's conjecture for Shannon OR-capacity: counterexamples and asymptotic separation
- The 3-Color 2-Chromatic Gallai-Ramsey Number for Complete Graphs