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

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,165 studies

  1. Covering Bridgeless Claw-Free Cubic Graphs with Perfect Matchings
    Huaibin Zhou, Xiumei Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. Counting hypergraphs without linear cycles of fixed length
    József Balogh, Ramon I. Garcia, Abhishek Methuku
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. The directed temporal exploration problem
    Marcelo Garlet Milani, Lucas Picasarri-Arrieta, Chaoliang Tang +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. The stacking number of a tree
    John Fairfax-Ball
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. On the Moments of Least s-Gaps of Partitions and a Conjecture of Baruah and Talukdar
    Sourav Bhowmick, Nabin Kumar Meher
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  6. Proof of Almkvist's conjecture on the unimodality of partition polynomials
    Jianxi Mao, Wenle Shi, Bao-xuan Zhu
    arXivPreprintCC0Full textCombinatorics & discrete mathematicsarXiv
  7. Chasing rotational symmetry in the spectre tiling
    Marianne Imperor-Clerc, Jean-Francois Sadoc, Simon Tatham
    arXivPreprintCC BY-SA 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  8. A simple algorithm for computing Hamilton paths on independent set polytopes
    Jean Cardinal, Pia Herkenrath, Torsten Mütze +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  9. Freeness of Arrangements with Regular Underlying Matroids
    Weikang Liang, Suijie Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  10. Bounds and Limitations on Codes Achieving List Recovery Capacity
    Joshua Brakensiek, Yeyuan Chen, Aaron Putterman +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  11. Faster and simpler traversal of 0/1-polytopes
    Jiří Fink, Petr Hladík, Arturo Merino +2
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  12. Hamilton paths and cycles in flip graphs of (almost-)perfect matchings
    Sofia Brenner, Justin Dallant, Linda Kleist +3
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  13. Gluing diagrams part 1: A constructive solution for the Higman-Thompson group isomorphism problem
    Roman Gorazd
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  14. Quantum-assisted rendezvous on hypercubes: a quantum Bernoulli noise approach
    Ce Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsMathematical physicsProbabilityarXiv
  15. A Triangulation of the Flow Polytope of the Zigzag Graph
    Rachel Brunner, Christopher R. H. Hanusa
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full text1 citedCombinatorics & discrete mathematicsCrossref
  16. The Two-Variable Hypergraph Tutte Polynomial via Embedding Activities and Computation-Tree Activities
    Lilla Tóthmérész
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  17. Ultra Log-Concavity and Real-Rootedness of Dependence Polynomials
    Yan-Ting Xie, Shou-Jun Xu
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  18. Bounds on Treewidth via Excluding Disjoint Unions of Cycles
    Meike Hatzel, Chun-Hung Liu, Bruce Reed +1
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  19. How to Secure General Acceptance for a Matching? - Inverse Popular Matchings
    Erika Bérczi-Kovács, Eszter Szabó
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  20. State Transfer in Discrete-Time Quantum Walks via Projected Transition Matrices
    Krystal Guo, Vincent Schmeits
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full text1 citedCombinatorics & discrete mathematicsCrossref
  21. Enumerative Chromatic Choosability
    Sarah Allred, Jeffrey Allen Mudrock
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  22. Unavoidable Minors of Matroids with Minimum Cocircuit Size Four
    Matthew Mizell, James Oxley
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  23. Generalized Ramsey Numbers via Conflict-Free Hypergraph Matchings
    Natasha Morrison, Andrew Lane
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  24. Rainbow Triangles and the Erdős-Hajnal Problem in Projective Geometries
    Carolyn Chun, James Dylan Douthitt, Wayne Ge +3
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  25. A Generalization of RSK to d-Complete Posets
    Son Nguyen, Joseph Vulakh, Dora Woodruff
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full text1 citedCombinatorics & discrete mathematicsCrossref