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

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,165 studies

  1. Cartwright--Sturmfelsness of complementary determinantal edge ideals
    Koichiro Tani
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  2. Spectral extremal problems on 1-planar graphs without Friendship graph
    Jiamin Li, Dan Li, Yuanyuan Chen
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Sharp Asymptotics for the Solvability Probability of Random Stable Roommates
    Caden Young, Ian Studebaker
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  4. The maximum size of simple solid matching covered graphs
    Tong Zhang, Wei Li
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. Quantum walks and graph operations
    Joy Cooper, Homer De Vera, Hermie Monterde +3
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  6. The Area Asymptotics of (sn,n)-Dyck Paths
    Evan Conway, James Harbour
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  7. A Finite-Geometric Obstruction and a Polytopal Separation of Buchstaber Invariants
    Suyoung Choi, Hyeontae Jang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  8. Embedding equitable (s,p)-edge-colorings of Kn
    Stacie Baumann, Mika Olufemi, Stafford Yerger
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  9. A direct inductive proof of the sharp Merino--Welsh threshold for matroids
    Jungang Chen, Jiaxin Xie
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  10. An upper bound on the proper hat guessing number of graphs
    Ioannis Kakatelis
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  11. A linear-in-q range of dimensions for the MDS conjecture over 𝔽q in odd characteristic
    Xiang Fan
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  12. Geometric triangle-free graphs of large chromatic number
    István Tomon
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  13. A Proof of the Third and Cubic Borwein Conjectures
    Yicen Ma
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  14. On the Hilbert polynomial of the linked projective space
    Felipe De León, Eduardo Esteves, Eduardo Vital
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  15. A Characterization of Walk-Matrix Equivalence at Corank Two via Reciprocal WQH Switching
    Chaochao Zhu, Qin Yue
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  16. The classification of maximum scattered linear sets of PG(1,q5)
    Giovanni Longobardi, Valentina Pepe
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  17. Stationary common-neighborhood properties and partition hypotheses
    Xiang Li
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsLogic & foundationsarXiv
  18. On the majority game chromatic number of forests and other graphs
    Yash Chawda, Saraswati Girish Nanoti, Brahadeesh Sankarnarayanan
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  19. On p-Spread Measures
    Chen Li
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  20. The Converse Problem for the Morley Tetrahedron: Counterexamples, Conjectures, and Partial Results
    Quang Hung Tran
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  21. Infinite series of Deza graphs with strongly regular children
    Mikhail P. Golubyatnikov
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  22. A Moser-spindle-free 5-chromatic unit distance graph on 2131 vertices in the plane
    Jan Kristian Haugland
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  23. Additive decompositions of multiplicative subgroups via differential identities
    Albert Cochrane, Chi Hoi Yip, Semin Yoo
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  24. Multiplicative subgroups are not restricted sumsets
    Chi Hoi Yip, Semin Yoo
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  25. Perfect state transfer on mixed graphs: complete classes and transfer times
    Xingkun Song
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv