Combinatorics & discrete mathematics
4,014 studies257 in 7 days1,648 in 30 days
Filters
Latest
4,014 studies
- The equality s(G)=η(G)+exp(G)−1 fails for G=C27⊕ C6
- Finite tests and low-rank excluded minors for matroid path-width two
- The Erdős--Hajnal property for paths
- Theoretical relations between basic centrality measures in real-world networks
- Alternating Sums in Compositions
- Quadratic bounds for intersecting hypergraphs: An affirmative answer to a question of Duke and Erdős
- Improved lower bounds for the kissing number in dimensions 49 to 61
- Optimal asymptotic bounds for design curves on manifolds
- Approximation Algorithms for Maximum-Weight Degree-Bounded Forests
- Infinite Generalized Sidon Sets with a Negative Answer to a Problem of Szemerédi
- Graphic matroids with connectivity constraints
- Integral saturation of adjacency-degree lattices
- An infinite family of graphs with Šoltés fraction uniformly above one half
- Perfect 1-factorisations of K18 with a non-trivial automorphism group
- Dimension bounds for finite-volume hyperbolic Coxeter polytopes
- An approximate cactus-decomposition for vertex-connectivity
- The Maximum Diagonal Product of a Stochastic Matrix of Bounded Rank
- The Three-Color Generalized Schur Number of x+(k−1)y=z: A Proof for All k from a Critical Set of 33 Polynomials
- Boolean Rank Nine for Polygons with 35 to 40 Vertices
- Contractable 2-connected subgraphs in minimally 3-connected graphs
- Sharp Bounds for Edge Mappings of Graphs
- A log-concavity criterion for finite nonnegative linearization
- Short Paper No. 1: Relation between integer sequence A319433 and the maximum degrees of finite linear Jaco graphs
- A rigidity theorem for edge-connectivity under non-negative Bakry--Émery curvature
- Every k-Quasi-Planar Graph Has Linearly Many Edges