Skip to content
DraconiticResearch
Search Sources API
210,423 studies31 sourcesUpdated 35 min ago

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,165 studies

  1. Meet obstructions and saturation for the constant window convolution on graded posets
    Shinobu Yokoyama
  2. Sidon sets with Δ-separated sumsets in additive number theory
    Melvyn B. Nathanson
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  3. Shannon Capacity and Related Graph Invariants for Lexicographic Products
    Igal Sason
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. Havel--Hakimi Residues of Common-Divisor Graphs: Complete Asymptotics and Prime-Counting Structure
    Randy Davila
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. An Optimal Bound for Ramsey Goodness of Cycles
    Peiru Kuang, Yan Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  6. Extremal Families for the Erdős--Kleitman Problem: The Missing Constructions
    Cheng Chi, Yan Wang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  7. Compactness of abundance in asymmetric hypergraph removal lemmas
    Shuang Sun, Yan Wang, Yuyao Yang +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  8. Erdős-Hajnal conjecture beyond five-vertex graphs
    Shenwei Huang, Yiao Ju, Yidong Zhou
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  9. Colorful Exponential Random Graph Models
    Bhaswar B. Bhattacharya, Pierfrancesco Dionigi, Ankan Ganguly +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsMathematical physicsProbabilityarXiv
  10. Cycle-Structure Generating Functions for Special Breakpoint Graphs
    Max A. Alekseyev, Joseph T. Iosue, Adam Ehrenberg +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  11. On the stability of scheduling under a randomly varying channel: insights from generalised network flows and cephoids
    Nahuel Soprano-Loto, Urtzi Ayesta, Ina Maria Maaike Verloop
  12. Polychromatic Partitions, Kingman Theory, and Ewens Sampling Formula
    Lorenzo Dello Schiavo, Filippo Quattrocchi
    HALPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityHAL
  13. Almost Every Graph Is Reconstructible from Its Token Graphs
    Yuanming Luo
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  14. Mutually orthogonal anti-Latin squares
    Eishiro Aoyama, So Hasegawa, Masahito Hayashi +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  15. Sets whose differences avoid a bracket quadratic
    Khalid Younis
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  16. A Categorical Framework for the Negami Polynomial and Its Splitting Formula
    Iwao Mizukai
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  17. Equivariant Analytic Spectral Invariants of Açıkmeşe Lifts of Graphs with Self-Loops
    Johnny Lim
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  18. Fair Division of Graphs: Beyond Traceability
    Nicolas Bousquet, Frank Connor, Agnès Totschnig +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  19. Wallis-type products with polynomial exponents and the Dirichlet beta function at negative integers
    Joshua W. E. Farrell
  20. Orthogonal adjointness in posets with $0$
    Michal Botur, Ivan Chajda, Helmut Länger
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  21. A Sharp Small-Coefficient Variant of Khintchine's Inequality and the Sharp π/2 Theorem
    Lei Yu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  22. Triangulated polygons and Y-frieze patterns
    Hin Chung Henry Tsang, Jon Wilson
  23. Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance
    Antonio Jesús Lorite-López, Daniel Camazón-Portela, Juan Antonio López-Ramos
    arXivPreprintCC BY-SA 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  24. FirstFit online coloring in the random order model
    Xinyu Ye, Yuechuan Xu, Zixuan Wang +2
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  25. GPT, the Counterexample Machine
    Suvrit Sra
    arXivPreprintarXiv licenceFull textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv