Skip to content
DraconiticResearch
Search Sources API
203,952 studies31 sourcesUpdated 11 min ago

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,014 studies

  1. Equifacetted polytopes whose facets are products of simplices: The simplicial prism case
    Federico Castillo, Guillermo Piñeda-Villavicencio, José Alejandro Samper
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. Complete characterization of disconnected one-point unions of cycles with local antimagic chromatic number 2
    Gee-Choon Lau, Wai Chee Shiu
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. The Order Mass Identity of Rooted Forests, with a Direct Proof of the Extended Aldous-Broder Theorem
    Hugh Zheng
    arXivPreprintCC0Full textCombinatorics & discrete mathematicsProbabilityStatisticsarXiv
  4. Computing distances in braid-move graphs, higher Bruhat orders, and oriented-matroid mutation graphs is NP-hard
    Tilen Marc
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. A Topological Figiel-Lindenstrauss-Milman Theorem and its Applications
    Florian Frick, Kaave Hosseini, Eric Myzelev +2
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  6. Extremal problems for suspensions of even cycles
    Dingyuan Liu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  7. A Method of Construction of Pairwise Additive Balanced Incomplete Block Designs
    Kazuki Matsubara, Satoru Kadowaki
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  8. Broadcast Domination Number is at Most Twice the Multipacking Number
    Sk Samim Islam
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  9. Near-optimal Turán densities of r-graphs on r+1 vertices
    Jiabao Yang, Xiutao Zhu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  10. The Size of the Intersection of q-ary Hamming Balls
    Ville Junnila, Tero Laihonen, Tuomo Lehtilä +1
    arXivPreprintCC BY-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  11. Amply regular graphs with μ close to half the valency and group divisible designs
    Wei Jin, Jack H. Koolen, Chenhui Lv
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  12. Combinatorics of Generalized Orthogonal Polynomials of Type RII
    Jang Soo Kim, Minho Song
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full text1 citedCombinatorics & discrete mathematicsCrossref
  13. On a q-Analogue of the Zeta Polynomial of Posets
    Frédéric Chapoton
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  14. Boolean Combinations of Graphs
    Sarosh Adenwalla, Samuel Braunfeld, John Sylvester +1
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  15. Graph Powers of Groups
    Gabe Cunningham, Igor Minevich
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  16. Det-Extremal Bipartite Graphs
    Wei Li
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  17. Hypergraph Turán Problem of the Generalized Triangle with Bounded Matching Number
    Jian Wang, Wenbin Wang, Weihua Yang
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  18. Perfect Codes in Cayley Graphs of Hajós Groups
    Yusuf Hafidh, Binzhou Xia, Sanming Zhou
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  19. Hook Immanantal Inequalities for Totally Nonnegative Matrices
    Mark Skandera
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  20. Translating Between the Representations of an Acyclic Convex Geometry of Bounded Degree
    Oscar Defrain, Arthur Ohana, Simon Vilmin
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  21. Powers of Hamiltonian Cycles in Randomly Augmented Pósa-Seymour Graphs
    Sylwia Antoniuk, Andrzej Dudek, Andrzej Ruciński
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  22. On the Minimum Number of Hamilton Cycles in Hamiltonian Threshold Graphs: A Simple Proof
    Chengli Li, Feng Liu
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  23. A Note on Vertex-Critical Induced Subgraphs of Shift Graphs
    Tomáš Kaiser, Matěj Stehlík, Riste Škrekovski +1
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  24. Bilateral Parking Procedures
    Philippe Nadeau
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  25. Conjugating Full Cycles by Adjacent Transpositions: Diameter and Sorting Time
    Ron M. Adin, Eli Bagno, Yuval Roichman
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref