Skip to content
DraconiticResearch
Search Sources API
209,918 studies31 sourcesUpdated 7 min ago

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,167 studies

  1. The Conway-Wales lattice and the Rudvalis and Tits groups
    Gerald Höhn
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  2. A Proof of the Dittert Conjecture via Boundary Rigidity
    Xinan Dai, Wenhao Deng, Yingdong Shi +2
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  3. The number of Laplacian eigenvalues of trees less than one
    Jiaxin Guo, Tao Hu, Quanyu Tang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. A New Upper Bound for 7-Universal Tournaments
    Harshit Verma
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. On the Cardinality of the Smith Set Under Impartial Culture with Many Alternatives
    Zachary Berchenko, Kaizhao Liu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  6. ℓ1-Embeddability of Regular Quadrilateral Maps on the Torus and the Klein Bottle
    Guangfu Wang, Wenchao Cong, Chunxiao Xu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  7. Arc-disjoint Hamiltonian paths in Cayley digraphs with a normal difference subgroup
    SangHyun Park
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  8. Branch-Sensitive Density Increments for k-Configurations
    Yao Zhi
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  9. All polyhedral graphs with at most 16 vertices are Schurian: a computational verification
    David Reh
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  10. Uniform meandric systems as percolation on planar maps: conjectures and a numerical study
    David Wei
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsMathematical physicsProbabilityarXiv
  11. A Density Method for Bounding Heesch Numbers in 𝔼3
    Aleksa Džuklevski
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  12. Homomesy of Tropical T-systems: Finite Type
    Ariana Chin, Pavlo Pylyavskyy
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  13. Shuffle automata and the growth of 1324-avoiding permutations
    Robert Brignall
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  14. 123-Avoiding permutations with an adjacency constraint
    Nathaniel Nadler
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  15. Burning Signed Graphs
    Shaun Fallat, Himanshu Gupta, Kamyar Khodamoradi +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  16. Pattern restricted parking functions with limited preferences
    Kassie Archer, Robert Laudone
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  17. Non-Malleable Affine Extractors with Small Error and Complexity Lower Bounds
    Xin Li, Yan Zhong
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  18. Note on near-spanning balanced antidirected trees missing from regular tournaments
    Gregory Gutin, Yiming Hao
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  19. The Boolean lattice ℬ6 is not a sphere order
    David A. Meyer
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  20. Beyond Liu's 0.382709 threshold for the union-closed sets conjecture
    Simone Costa, Ankan Sadhu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  21. A linear gap for the maximal cp-rank
    Yair Lavi
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsOptimisation & controlarXiv
  22. Local Shellings of Broken-Circuit Complexes via Boundary States and the Chromatic Specialization of the Negami Polynomial
    Iwao Mizukai
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  23. Greedy Uniformity on Trees: Exact Obstruction and Near-Uniform Spiders
    John Fairfax-Ball
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  24. Maximum Edge Open Packing on AT-Free, Chordal, and Convex Bipartite Graphs
    Gautam K. Das, Kamal Santra
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  25. Degree sequences of spectrally extremal connected nonregular graphs with prescribed maximum degree: the dense case
    Zejun Huang, Chenxi Yang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv