Skip to content
DraconiticResearch
Search Sources API
206,690 studies31 sourcesUpdated 21 min ago

Combinatorics & discrete mathematics

4,165 studies347 in 7 days1,766 in 30 days

Filters
Type
Date
Clear

Latest

4,165 studies

  1. Schur positivity of the lattices m×n
    Kai Zhang
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Structural Properties of DomiRank Centrality: Symmetry Axioms, an Entropy Bound, and Spectral Interpolation
    Yingying Zhang, Chengye Zhao
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Disproof of a Conjectured Upper Bound for the Davenport Constant
    Guoqing Wang
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  4. Unique Minimizers for Permanents, Mixed Discriminants, and Log-concave Polynomials
    Leonid Gurvits, Jonathan Leake
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsOptimisation & controlarXiv
  5. Non-convex polytopes realizing kissing contact graphs in dimensions 5-7
    Matthew Self
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  6. The Multiorbital Bivariate Chromatic Polynomial: A Subgroup-Lattice Refinement
    Melanie Gerling
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  7. On high-girth layered graphs of large Turán density in a hypercube
    Maria Axenovich, Marko Pejić
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  8. HJ numbers revisited
    Saharon Shelah
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  9. On balanced subfamilies of maximum complement-free families in the middle layer of the Boolean lattice
    Sa'ul A. Blanco
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  10. On set-like sunflower-free families of subspaces over finite fields
    Kamil Otal
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  11. Connectivity Bounds for GHZ Graphs
    L. Sunil Chandran, Rishikesh Gajjala
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  12. A quadratic ancestor inequality for spanning trees
    Gefei Cai
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsMathematical physicsProbabilityarXiv
  13. A complete classification of perfect state transfer in Grover walks on abelian Cayley graphs
    Koushik Bhakta, Bikash Bhattacharjya
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  14. Beyond 11/16: dense Kuramoto networks that resist synchrony
    Kevin P. O'Keeffe
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsDynamical systemsarXiv
  15. Power-of-two cycles in projective cubic graphs of large edge-width
    Jean-François Culus
    HALPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsHALarXiv
  16. The Closed Geodetic Game: algorithms and strategies
    Antoine Dailly, Harmender Gahlawat, Zin Mar Myint
    Theoretical Computer SciencePeer-reviewedCC BY-SA 4.0Full textCombinatorics & discrete mathematicsHAL
  17. Exact Realization of Edge and Induced Three-Vertex Subgraph Counts
    Hillel Schein
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  18. Connected graphs with equal independence number and radius
    Xingzhi Zhan
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  19. Gaps for PLRS with zero coefficients
    Yinxi Chen, Zongyun Chen, Brian Hii +1
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  20. Planar Disk Filters and Real Chromatic Roots at Beraha Numbers
    Reza Mactabi
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsMathematical physicsarXiv
  21. The square achievement game on n × n boards
    Sean Reid
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  22. Crossing numbers of simplicial complexes
    Alfredo Hubard, Cheikh Saliou Ndiaye, Oriol Solé-Pi
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  23. Path Covering Spaces of Posets
    Matteus Froese, Ian George
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  24. The AA problem for finite ordered sets
    Jonathan David Farley, George Grätzer
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  25. Two Short Proofs of the AA Theorem
    George Grätze
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv