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

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,165 studies

  1. Mixing Times of Switch Chains via High-Dimensional Expansion
    Sawyer Jack Robertson
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  2. Graph Sensitivity of Cartesian Products with Matched Bridges
    Zhen-Mu Hong, Zi-Yi Wu, Zheng-Jiang Xia
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Coloring Monomial Cayley Graphs: The One-Parameter Case
    Jonathan Davidson
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  4. Characterizing chordal llcorner-EPG graphs via admissible clique tree orientations
    Bin Sun, Shou-Jun Xu, Yu Yang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. Non-uniqueness of optimal $1$-embeddings on surfaces up to weak equivalence
    Kengo Enami
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  6. The singularity probability of dense random regular graphs
    Zeyan Song, Hanchao Wang, Shengyan Yin +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  7. A linear bound for a connectivity partition in graphs
    Jia Zhou, Jin Yan, Yunshu Gao
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  8. The Higher-order Stirling Triangles
    William Y. C. Chen, Elena L. Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  9. A near-quadratic lower bound for sets with no unique sums
    Jianfeng Hou, Kai Yang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  10. Log-concavity and unimodality of cluster monomials in fan coordinates of type An
    Zhichao Chen, Zhe Sun
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  11. On graphs whose powers are well-covered
    My Hanh Pham, Thanh Vu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  12. Optimal bound for the polynomial Littlewood-Offord problem
    Alexandr Grebennikov
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  13. A proof of the Berkovich-Dhar conjecture modulo three
    Shutao Jiang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  14. Posh Parking Spaces
    Jason Stack, Nathan Williams
    arXivPreprintCC BY 4.0Full text1 citedAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  15. Extremal subspace covers in finite vector spaces
    Mohsen Aliabadi
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  16. Density regularity of {x,x+y,xy} in the integers
    Florian K. Richter, Konstantinos Tsinas
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  17. A Szemerédi-Trotter Theorem in Arbitrary Fields
    Mark Lewko
  18. Rainbow spanning configurations in uniformly coloured pseudorandom graphs
    Elad Aigner-Horev, Dan Hefetz, Yury Person +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  19. The Three-Dimensional Erdős Box Problem Has Exponent 11/4
    Dean Menezes
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  20. Surjectivity of the Enots Wolley Sequence
    Nathan Myles Nichols
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  21. On embeddings of the difference graph of the intersection power graph and the power graph
    Manisha, Ekta, Jitender Kumar
    arXivPreprintCC0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  22. An independent proof of the even-dimensional S-matrix inequality
    Yinjie Li
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  23. Rigorous Asymptotic Analysis of 3-Noncrossing Skeleton Diagrams
    Yangyang Zhao
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  24. On the odd independence number of the Queen graph
    Martin Knor, Jelena Sedlar, Riste Škrekovski
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  25. Hall's universal group does not have finite big Ramsey degrees
    Dragan Mašulović, Veljko Toljić
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv