Skip to content
DraconiticResearch
Search Sources API
206,698 studies31 sourcesUpdated 58 min ago

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,165 studies

  1. The chromatic number of the associahedron: simple and logarithmic
    Benjamin Aram Berendsohn, Jean Cardinal, John Iacono +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. A linear upper bound for Berge saturation numbers
    Tianying Xie
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Spreads of degrees in maximal planar graphs -- an exposition
    Yair Caro, Riste Škrekovski, Christina Zarb
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. Distinct flattened partitions avoiding a pattern of length four
    Toufik Mansour, Olivia Nabawanda, Mark Shattuck
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. The domination number of the $2$-token graph of path graphs
    Emmanuel Acosta Troncoso, Luis Manuel Rivera
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  6. Quantum super Schur--Weyl duality and character formulas for mirabolic Hecke algebras
    Naihuan Jing, Ning Liu
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  7. Almost all graphs are determined by their generalized spectrum
    Ziqing Xiang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  8. A duality-preserving extension of the Worley-Sagan insertion and Haiman's mixed insertion for the hyperoctahedral group
    Masato Nakagiri
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  9. A Log-Star Comparison Between Expectation Threshold and Fractional Expectation Threshold
    Xuan Fang, Tianyu Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  10. Minimum blockers and extremal graphs for nonnested matchings
    Pedro M. M. de Castro
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  11. Random Permutation Matrices Form a Basis with High Probability
    Yijun Jiang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  12. An e-positive classification for complete multipartite graphs
    Ariel Y. Sun, David G. L. Wang, Watson Z. Y. Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  13. Mutually unbiased bases: common states, completion, and extension obstructions
    Hao-Yu Sun
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsMathematical physicsarXiv
  14. The Davenport constant of balls and boxes
    Benjamin Girard, Alain Plagne
    HALPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsHAL
  15. Maximal Order Type and Width of the h-Preorder on Finite Labeled Trees
    Ilya Smirnov
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsLogic & foundationsarXiv
  16. The Computational Complexity of the Ungar Games on Distributive Lattices
    Kengo Hashimoto
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  17. A G-Invariant Erdős--Hanani Theorem with Applications to Optical Orthogonal and Constant-Weight Codes
    Yeow Meng Chee
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  18. Smallest String Attractors and Minimal Coverage Certificates of Thue--Morse Words
    Simone Faro, Francesco Pio Marino, Arianna Pavone
    arXivPreprintCC BY 4.0Full text1 citedCombinatorics & discrete mathematicsarXiv
  19. Decomposition Profiles and Weisfeiler-Leman Dimension for Graphs of Bounded Rank Width
    Antonios Kalampakas
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  20. Obstructions to k-colouring H-free graphs
    Iain Beaton, Ben Cameron, Adam van Omme
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  21. Two proofs and a tight Szemerédi--Trotter theorem
    Hung-Hsun Hans Yu
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  22. The Hellinger Conjecture for Antipodal Boolean Functions
    Vu Khac Ky
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  23. Rogers--Ramanujan identities from the geometry of Xa=Yb
    Yifeng Huang, Kenny Lau, Ken Ono
    arXivPreprintCC0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  24. Connective constants of Grigorchuk graphs
    Geoffrey R. Grimmett
  25. Random permutations using GEPP
    Kenji Gunawan, John Peca-Medlin, Chenyang Zhong