Skip to content
DraconiticResearch
Search Sources API
209,918 studies31 sourcesUpdated 30 min ago

Combinatorics & discrete mathematics

4,167 studies349 in 7 days1,768 in 30 days

Filters
Type
Date
Clear

Latest

4,167 studies

  1. Asymptotically unit-rate storage codes from binary BCH codes
    Aryeh Lev Zabokritskiy
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. K-k-Schur functions are k-Schur positive
    Haojun Bai, Peter L. Guo
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. On C*-nuclearity of graph operator systems
    Adam Dor-On, Travis Russell
    arXivPreprintarXiv licenceFull textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  4. Structural stability of systems and cycle covers in random graphs
    Mohamed Ali Belabbas
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsOptimisation & controlProbabilityarXiv
  5. Stable and Online Algorithms for Random Matrix Discrepancy
    Eren C. Kızıldağ, Shuangping Li
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  6. On k-limited domination: complexity and Sierpiński graphs
    Dragana Božović
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  7. Tight degeneracy bounds in online Ramsey games
    Wen Chen, Qizhong Lin, Shixi Song
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  8. An improved lower and upper bound of the k-limited domination number
    Gordana Radić
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  9. On the Classical and Parameterized Complexity of Strong Odd Coloring
    Dinabandhu Pradhan, Vaishali Sharma, Shaily Verma
    arXivPreprintCC BY-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  10. Automorphisms of pentagonal geometries with block size 3
    Grahame Erskine, Terry S. Griggs
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  11. A unified framework for existing and new constructions of Neumaier graphs
    Aida Abiad, Wouter Castryck, Maarten De Boeck +2
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  12. A proof of Lehmer's permutation conjecture for neighbor-swap graphs
    Tom Verhoeff
    arXivPreprintCC BY-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  13. Morley Simplices in Higher Dimensions: Regularity, Reflections, and Counterexamples
    Quang Hung Tran
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  14. Upper Bounds on the Turán Density of Hypergraphs Associated with the Projective Plane over a Finite Field
    Subhankar Dash, Kaushik Majumder
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  15. Descent Tops and Pinnacles on 2143- and 3421-Avoiding Permutations
    Yue Dong, Lily Li Liu, Tongyuan Zhao
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  16. Coloring 3-colorable graphs with O(n4/23) colors via a Gaussian-cover recursion
    Emile Anand
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  17. A Hadamard Cube of Order 22
    Amin Bahmanian, Sho Suda
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  18. Degree-square Turán problem for two self-converse tournaments
    Zhuoran Han, Yaojun Chen
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  19. Zeros and interlacing for multiset Eulerian-Narayana polynomials
    Philip B. Zhang, Tongyuan Zhao
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  20. A zero-one law for swap-invariant events in uniform spanning forests
    Xinyi Li, Yao Yu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  21. The threshold for fractional clique decompositions of random hypergraphs, via matrix scaling
    Tuan Tran
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  22. Towards Strongly Aperiodic Monotiles in Higher Dimensions
    Dmitry Kamenetsky
  23. Fair Duels after a False Start
    Tanya Khovanova, Tejo Madhavarapu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  24. The least signless Laplacian eigenvalue of {C3,C5}-free graphs
    Qi Zhou
    arXivPreprintCC0Full textCombinatorics & discrete mathematicsarXiv
  25. Multiplicative recurrence of Piatetski--Shapiro and nil-Bohr sets
    Sun-Kai Leung