Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 26 min ago

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,014 studies

  1. Off-diagonal Ramsey numbers for 3-uniform tight hypergraph cycles
    Eng Keat Hng
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. The complete existence spectrum of periodic complementary ternary pairs of weight nine
    Stelios D. Georgiou, Stella Stylianou
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. On the Turán Number of the Cartesian Product of Two Stars
    Quan Sun, Long-Tu Yuan
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. Strongly explicit Ramanujan 2-lift towers via Hilbert modular forms
    Olga Kharlampovich, Igor Pak, Alina Vdovina
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  5. e-Positive caterpillars have maximum degree at most three
    Davion Q. B. Tang, David G. L. Wang, Monica M. Y. Wang
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  6. Guaranteed indirect delivery in directed networks: The joint extremal function and explicit attaining constructions
    Angel Ivanov Raychev
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  7. The maximum number of triangles in regular graphs
    Ya-Hong Chen, Shi-Cai Gong, Changhong Lu +2
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  8. A polynomial method over formal power series
    Artur Akhiiarov, Mikhail Koshelev, Andrey Kupavskii +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  9. Turán numbers for suspensions of bipartite 2-regular graphs
    Haoxing Wu, Junxue Zhang
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  10. Diameter-two graphs whose mutual-visibility chromatic number equals their chromatic number
    Siddhesh Chaubal
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  11. Linear hereditary quasirandomness
    Jun Yue
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  12. On two problems concerning the geodesic transversal number of graphs
    Shi Chen, Xuanlong Ma, Tingzeng Wu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  13. The Stable Tamari Lattice
    Herman Chau, Spencer Daugherty, Sean Grate +3
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  14. The Liouville property for geometric graphs in the plane
    Kuijun Liu, Feng Luo, Yanwen Luo +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyProbabilityarXiv
  15. Error terms for sums of two linear transformations
    Xiao-Hui Yan
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  16. Every group is the automorphism group of a set-theoretic solution of the Yang--Baxter equation
    G. Militaru
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  17. Simplified dense model theorem for random discrete structures
    Rajko Nenadov
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  18. CA2 numbers and the Riemann hypothesis: a numerical investigation of Ramanujan's inequalities
    Dmitry R. Leshchiner, Oleg R. Musin, James Thompson
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  19. Some results on intersecting families of triangulations
    Imre Leader, Ta Sheng Tan
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  20. Finding solutions with the Borsuk-Ulam theorem
    Oleg R. Musin
  21. Weighted Turán densities for hypergraphs
    David James, Bernard Lidický, Dhruv Mubayi
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  22. Borsuk number in four dimensions is at most seven
    Andrii Arman, Andriy Bondarenko, Andriy Prymak +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  23. A lattice path model for Schubert and forest polynomials: positivity and combinatorial interpretations
    Hojoon Lee
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  24. Identifying codes of Archimedean grids
    Rudini Sampaio
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  25. Complete Determination of the Gallai--van der Waerden Number GW(r;3,3)
    Yuan Si
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv