Skip to content
DraconiticResearch
Search Sources API
210,049 studies31 sourcesUpdated 59 min ago

Combinatorics & discrete mathematics

4,167 studies349 in 7 days1,768 in 30 days

Filters
Type
Date
Clear

Latest

4,167 studies

  1. Rainbow paths in directed graphs
    Chase Wilson
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. An infinite walk in ℕ16, using only unit steps, with no three collinear points
    Jeffrey Shallit
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Small circumference in regular sublinear expanders
    Yaobin Chen, Hong Liu, Xin Wei +1
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. A Forced-Structure Reduction and Verifiable Bounds for Conway's 99-Graph
    Aalok Thakkar, Simone Severini
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Discrete Einstein metrics on unicyclic graphs
    Shuliang Bai
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  6. Local versus global average degree in bipartite graphs
    Jianfeng Hou, Hongbin Zhao
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  7. Subindices and subfactors of ℤn and k-index stability of finite groups
    M. H. Hooshmand
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  8. Frayed Demazure weaves for Poisson-compatible cluster structures on Bott--Samelson charts
    Jon Cheah
    arXivPreprintCC BY-NC-SA 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  9. Tree-independence number of P5-free graphs with no large bicliques
    Václav Blažej, J. Pascal Gollin, Tomáš Hons +5
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  10. Intractable enumeration problems are like Russian nesting dolls: structural properties of monomer-dimer coverings on two-dimensional quadratic lattices
    Yong Kong
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  11. The maximum spectral radius of uniform hypergraphs whose shadow excludes a complete or complete bipartite minor
    Pei Liu, Suil O
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  12. Large signed sums of unit vectors: the first linearly dependent case
    Damián Pinasco
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  13. Helly complexes are Hellyfications of their boundaries
    Martín Blufstein
  14. Four collinear points or six visible points
    Stijn Cambie
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  15. Unimodality of Independence Polynomials for Sufficiently Large Forests
    Ethan X. Fang, Junwei Lu, Eran Nevo +2
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  16. Condensed configurations and valuative matroid invariants
    Jens Niklas Eberhardt
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  17. Majority C-coloring in Cartesian products
    Csilla Bujtás, Magda Dettlaff, Hanna Furmańczyk +2
    arXivPreprintCC0Full textCombinatorics & discrete mathematicsarXiv
  18. A note on generating polyhedra and quadrangulations
    Luisa Andreis, Riccardo W. Maffucci, Federico Polito
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  19. Boolean Small-Ball Inequalities for Discrepancy Theory
    Emrullah Akbas, Suvrit Sra
    arXivPreprintarXiv licenceFull textAnalysis & PDEsCombinatorics & discrete mathematicsProbabilityarXiv
  20. Combinatorics of hyperplane arrangements and Witten zeta function at the origin
    Kam Cheong Au, Kazuhiro Onodera
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  21. Longest cycles intersect linearly in highly connected graphs
    Jie Ma, Bo Ning, Ziyuan Zhao
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  22. Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
    János Pach, Gábor Tardos
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  23. Framingtopes
    Sergio Alejandro Fernandez de soto Guerrero, Cesar Ceballos, Matias von Bell
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  24. Infinite log-concavity of the Boros--Moll sequences
    Matthew H. Y. Xie, Philip B. Zhang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  25. Arboricity and Simplicial Geometric Category of Wedges and Joins of Graphs
    Nursultan Kuanyshov, Islam Yeginbay
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv