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

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,165 studies

  1. Elementary graphs are chromatic-choosable
    Narayanan N, Nandana K. Vasudevan, K. Somasundaram
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Tournaments with many Hamilton cycles
    N. C. Wormald
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Subgroup Perfect Codes in Bi-Cayley Graphs
    Masoumeh Koohestani, Nasrin Soltankhah, Mohsen Ghasemi
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. A Proof of the Erdős Matching Conjecture for Large Matchings via Sharp Tail Probability for Sums of i.i.d. Nonnegative Random Variables
    Cheng Chi, Shuang Sun, Yan Wang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  5. On Mattila's intersection problem in the plane: sharp dimension and positive measure of rotated difference sets
    Thang Pham, Chun-Yen Shen, Dung The Tran
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  6. QPTAS for Max Weight Independent Set in Graphs with Strongly Edge-Sublinear Separators
    Édouard Bonnet, Yeonsu Chang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  7. Dot actions and Hessenberg spaces for dihedral groups
    Jonathan Boretsky, Reuven Hodges, Nathan Lesnevich +2
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  8. Resolving Pisanski's Conjecture
    Austin Ulrigg, Alexander Metzger
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  9. The optimal van der Corput property for squares
    Steve Fan, Andrew Lott
    arXivPreprintCC BY-NC-ND 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  10. Graphical Discreteness, Coxeter Doublings and Generalized Polygons
    Xing-Yu Hu
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  11. The Negami Polynomial and Broken-Circuit Stanley--Reisner Rings
    Iwao Mizukai
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  12. A Proof of Albertson's Conjecture
    Ankan Sadhu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  13. The Hajnal-Szemerédi theorem in digraphs revisited
    Yufei Chang, Louis DeBiasio, H. A. Kierstead +2
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  14. Graphon as a Bridge between Graphs and Manifolds
    Dong Zhang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  15. Acyclic Dichromatic Number of Tournaments: these are the Champions
    Pierre Aboulker, Pierre Charbit, Samuel Coulomb +2
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  16. Total positivity and symmetric spaces
    Huanchen Bao
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  17. k-neighborhood ideals of graphs
    Somayeh Moradi, Leila Sharifan
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  18. New results on the odd- and unique-Ramsey numbers
    Shagnik Das, Ying-Sian Wu
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  19. Whither quantum advantage? New classical lower bounds for Max-Cut on large-girth 3-regular graphs
    Flaviano Morone, Shivang Rawat, Dries Sels
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  20. From Trees to All Loops: The Combinatorial Geometry of Two-Site Cosmological Wavefunctions
    Yanfeng Hang, Cong Shen
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  21. Determinantal linear spanning forests
    Adrien Kassel, Thierry Levy
    HALPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsProbabilityHALarXiv
  22. On the Local Resilience of Random Geometric Graphs With Respect to Connectivity and Long Cycles
    Alberto Espuny Díaz, Lyuben Lichev, Alexandra Wesolek
    Random Structures and AlgorithmsPeer-reviewedCC BYCombinatorics & discrete mathematicsHAL
  23. The Davenport constant of low-dimensional boxes
    Benjamin Girard, Alain Plagne
    HALPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsHALarXiv
  24. Explicit matrix hitting points for noncommutative algebraic branching programs
    Zhipeng Lu
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  25. Equidistribution of mesh patterns of length 2 on involutions
    Xinyu Su, Philip B. Zhang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv