Skip to content
DraconiticResearch
Search Sources API
210,418 studies31 sourcesUpdated 30 min ago

Combinatorics & discrete mathematics

4,165 studies279 in 7 days1,725 in 30 days

Filters
Type
Date
Clear

Latest

4,165 studies

  1. All-Minors Matrix-Tree Theory for Superport Networks: Completed Quotient-Incidence Determinants and Conductance-Weighted Subdivision Extensions
    Tony Newton
    arXivPreprintCC BY-SA 4.0Full textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  2. Folded-Algebraic Matroids: Characteristic Rigidity and Almost-Entropic Separation
    Shahram Khazaei
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Comments on the recent improvements of the MRRW bounds
    Alexander Barg
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. Points of maximal traffic on a grid with obstruction
    Juan Gil, Zhenni Liang, Ayodeji Odetola +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. Singularities of star cluster algebras
    Eleonore Faber, Bernd Schober
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  6. A Tight Erdős-Stone Bound for All Graph Densities
    Asaf Shapira, Raphael Yuster
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  7. A General Construction of Codes from Drinfeld Modules
    Alessandro Giannoni, Giacomo Micheli, Mihran Papikian
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  8. Box-Delaunay graphs of large chromatic number
    István Tomon
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  9. Flip-graph non-convexity for once-punctured polygons
    Lionel Pournin, Zili Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  10. Exact curve counting of given word length on the once-punctured torus
    Filippo Baroni, David Fisac, Mingkun Liu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  11. Common neighbour conjectures for Saxl graphs fail at every base size
    Aluna Rizzoli, Adam R. Thomas
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  12. Hamilton Starters and Path Decompositions in Directed Circulants
    Jianwei Jiang, Chunhua Yang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  13. The Composition Lemma for n-dependence
    Artem Chernikov, Yuyan He
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsLogic & foundationsarXiv
  14. Unbalanced spectral Turán problem for color-critical graphs with prescribed large maximum degree
    Chang Liu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  15. The real-rootedness of the toric g-contribution polynomials
    Qiqi Xiao
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  16. Dominant-Degree Conditions for Ramsey--Turán Factors of Non-Directed Cycle Orientations
    Jia Zhou, Yunshu Gao
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  17. Palindromic real-rooted polynomials and h-vectors of polytopes
    Peter L. Guo, Mingyang Kang
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  18. Forcing monochromatic subdivisions
    Gabriel Collado, Dhruv Mubayi
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  19. A 21-Coloring of the Plane Without Monochromatic Unit-Area Rectangles
    Gary Hu, Yumo Liu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  20. Graph Coloring with Color Preferences
    Tomohiro Koana, Yeeseok Oh, Hirotaka Yoneda
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  21. Two-basepoint Terwilliger algebras and the quantum symmetry of prime-order circulants
    Mohammad F. Marashdeh
    arXivPreprintarXiv licenceFull textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  22. Shannon's problem on the monotonicity of entropy and a Conjecture of Tao
    Ziran Liu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  23. On Unavoidable Faces of High-Dimensional Polytopes
    Jesús A. De Loera, Ethan X. Fang, Shengtao Guo +2
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  24. Graphs with Long Pseudosimilarity Chains under Consecutive Vertex Deletions
    Sergey Ivanov
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  25. List coloring C3-free planar graphs with a sparse matching of restricted lists
    Stephen G. Hartke, Yupei Li, Joseph Pappe +3
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv