Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 38 min ago

Combinatorics & discrete mathematics

4,014 studies257 in 7 days1,648 in 30 days

Filters
Type
Date
Clear

Latest

4,014 studies

  1. The microscopic weighting on a metric space
    Emily Roff, Simon Willerton
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  2. Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
    Marcelo Arenas, María Alejandra Schild, Bernardo Subercaseaux
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Off-Diagonal Induced Ramsey Numbers
    Bruno Andrades, Marcelo Campos, Rafael Filipe +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. Largest Sperner families with bounded VC-dimension
    Gennian Ge, Hanyu Wang, Zixiang Xu +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Deterministic Fault-Tolerant Connectivity Oracles with Subquadratic Space
    Merav Parter, Elad Tzalik
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  6. Hessenberg character
    Patrick Brosnan, Jaehyun Hong, Donggun Lee
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  7. Matching Random Point Sets with Minimum Distortion
    Itai Benjamini, Mark Braverman, Elad Tzalik +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyProbabilityarXiv
  8. Boxicity of Power Graphs of Finite Nilpotent Groups
    L. Sunil Chandran, Jinia Ghosh, Suraj Kumar Sahoo
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  9. Monadically Dependent Graph Classes Have Almost Bounded Merge-Width
    Jan Dreier, Nikolas Mählmann, Michał Pilipczuk +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsLogic & foundationsarXiv
  10. Finding full immersions is fixed-parameter tractable in labeled tour graphs
    Hadas Barabash, Jim Geelen, Rose McCarty +2
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  11. Proof of two conjectures on the log-concavity of partition ranks and cranks
    Jianxi Mao, Wenle Shi, Bao-Xuan Zhu
    arXivPreprintCC0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  12. The Exact Number of Pentagons in Book-Free Graphs
    Wentao Hu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  13. Fixed-Radius Neighbourhoods in Three-Dimensional Unit-Cube Graphs
    Guangjian Zhang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  14. A family of symmetric counterexamples to the bent sum decomposition conjecture
    Máté Róbert Kepes, Anita Kercsó-Molnár, Viczián András
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  15. Counting graphs admitting a strictly matched involution
    Stephan Dominique Andres, Igor Režan
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  16. Polylogarithmic bound for the Gyárfás-Sumner conjecture
    Martin Bierbaumer, Matija Bucić
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  17. Non-induced inherent graphs
    Vladimir Gurvich, Matjaž Krnc, Martin Milanič +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  18. A Sub-3n Upper Bound on the Number of Stable Matchings
    Ken-ichi Kawarabayashi, Hikaru Wada, Masataka Yoneda
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  19. Baxter Structures and the Odd-Even Enumeration of Red-Blue Motzkin Paths
    Joanna N. Chen
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  20. A characterization of a family of integral Cayley graphs
    Sauvik Poddar, Sucharita Biswas
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  21. Ideals of 2-minors of nearly determinantal matrices
    Takayuki Hibi, Francesco Navarra, Ayesha Asloob Qureshi
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  22. A 2.81n upper bound on the number of stable matchings
    Ebrahim Ghorbani, Matthias Mnich
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  23. How many sorted projections determine n points in k dimensions?
    Christopher Gorham Lester, Raymond Hau Sørensen
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  24. Cycles in Regular Multipartite Tournaments
    Yufei Chang, Zhilan Wang, Shuo Wei +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  25. Planar Central Configurations of Four Equal Masses: Classification and Morse Indices
    Xiaoxiang Huangfu, Huatong Shen
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsDynamical systemsarXiv