Skip to content
DraconiticResearch
Search Sources API
203,952 studies31 sourcesUpdated 42 min ago

Combinatorics & discrete mathematics

4,014 studies198 in 7 days1,616 in 30 days

Filters
Type
Date
Clear

Latest

4,014 studies

  1. 立体矩阵的内蕴结构:胞腔复形与等价类全谱
    Liang Wu
    Zenodo (CERN European Organization for Nuclear Research)PreprintCC BY-NC13 citedCombinatorics & discrete mathematicsOpenAlex
  2. Nonintersecting Unit Diagonals in Odd Square Arrays
    Luyu Song
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. The minimum number of wheel-saturating edges
    Xianglei Chen, Changxiang He
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. Reconfiguration graphs of mutual-visibility sets
    Julián A. Fresán-Figueroa, Ilán A. Goldfeder, Aldo Lozano-Piña
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. The Heesch number in 𝔼3 is unbounded
    Bojan Bašić
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  6. Strong sl2 Actions and Symmetric Chain Decompositions
    Nate Harman, Rylan Rosas, Charles Troutman III +1
    arXivPreprintCC BY 4.0Full text1 citedAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  7. Energy of signed graphs and the vertex cover number
    Aniruddha Samanta, Deepshikha, Kinkar Chandra Das
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  8. The Kemeny-Braess Paradox in Random Graphs
    Manuel Bodirsky, Lorenzo Ciardo, Mihyun Kang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  9. Sumsets regularity versus Castelnuovo-Mumford regularity for monomial curves
    Prashant Chaudhary, Kapil Khandelwal
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  10. PArcK trees can get as hot as you want
    Svenja Huntemann, Neil A. McKay, Craig Tennenhouse
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  11. Sharp zero forcing numbers for the generalized Petersen graphs P(n,3) and P(n,4)
    Arnav Krishnan, Haobo Ma, Wenlin Zhang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  12. New lower bounds for binary constant-weight codes from prescribed-automorphism search, and two quantum codes meeting their upper bounds
    Chris Dzoba
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  13. Fuglede's conjecture holds in 𝔽27
    Atsushi Kadowaki
    arXivPreprintarXiv licenceFull textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  14. Graphic additive bases and graph flows
    Amir Jafari
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  15. T-embeddings as stationary measures on T-graphs
    Mikhail Basok, Benoit Laslier, Marianna Russkikh
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsMathematical physicsarXiv
  16. Symplectic Lie groups and nilmanifolds associated with acyclic quivers
    Yihao Zheng
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  17. Revisiting separators in string graphs, region intersection graphs, and induced-minor-free graphs
    James Davies, Paweł Rzążewski, Jack Spalding-Jamieson +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  18. Near optimal gap in the Lonely Runner Conjecture
    Xiyu Hu, Yifan Jing
    arXivPreprintCC BY-NC-ND 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  19. The maximum number of Hamiltonian cycles in tournaments
    Alexander Divoux, Shouda Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  20. The semiring of spectral duality skeletons: cancellation, characters and factorization
    Juan Antonio Vega Coso
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsProbabilityarXiv
  21. Line spreads of W(2n-1, q), q even
    Daniele Bartoli, Antonio Cossidente, Giuseppe Marino +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  22. On the Length of Maximum Sum-Rank Distance Codes
    Valentina Astore, Ferdinando Zullo
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  23. Four New Single-Error-Correcting Binary Codes
    Moshe Milshtein
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  24. Visibility Sets, Empty Pentagons, and Sufficient Conditions for Hexagons
    Carlos M. Nicolas
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  25. Small and large quasi-kernels: a weighted transfer theorem
    Jiangdong Ai, Gregory Gutin, Xiangzhou Liu +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv