Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 45 min ago

Combinatorics & discrete mathematics

4,014 studies257 in 7 days1,648 in 30 days

Filters
Type
Date
Clear

Latest

4,014 studies

  1. Automatic partition identities
    Laurent Bartholdi
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  2. Well-Covered Powers: Cartesian Products and Cayley Graphs
    Haobo Ma, Thanh Vu, Wenlin Zhang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Proper Conflict-Free Coloring on Structured Graph Classes: Bounds, Exact Algorithms, and Hardness
    Kamal Santra
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. Min-plus Bruhat decomposition
    Dima Grigoriev
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  5. Lemmas and Conjectures in Spectral Graph Theory
    Tristan Cazenave
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  6. On the lower- and upper bounds of three-colored anti-Ramsey numbers
    Máté Giesz
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  7. The Iterated Local Transitivity Model for oriented graphs
    Anthony Bonato, MacKenzie Carr, Ketan Chaudhary +2
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  8. A King for Almost Everyone
    Ziad Ismaili Alaoui, Oded Lachish, Nikhil S. Mande
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  9. Seshadri constants of singular loci of line arrangements with at most twelve lines
    Marcin Dumnicki, Łucja Farnik, Krishna Hanumanthu +4
    arXivPreprintCC BY-NC-ND 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  10. Circular flows and bisections of random regular graphs
    Amir Jafari
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  11. Universality in random graphs via optimal linking systems: trees and beyond
    Asaf Cohen Antonir, Lyuben Lichev, Maksim Zhukovskii
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  12. Balance in Inequality: Testing the Physical Equilibrium, Precession, and Structural Stability of Magic Gems
    Kyle Elliott Mathewson
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  13. Get Permanent Results Faster by Counting Stars
    Radu Curticapean
    arXivPreprintCC BY-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  14. On ill-distributed B3 and B4 sets
    André Hisatsuga, Rafael Miyazaki, Cosmin Pohoata
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  15. Uniform Sampling of Linear Codes with Prescribed Hull Dimension
    Keita Ishizuka
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  16. The proof of the Harary--Hill conjecture: a detailed exposition and an extension to rotation systems
    Gelasio Salazar
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  17. The Optimizer's Windfall: Bounding Hindsight Gain under Random Restrictions
    Xiaohui Bei, Wenhao Wu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  18. A nearly tight bound on the probability G(n,p) is even-degenerate
    Ting-Wei Chao, Bruce Reed
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  19. Proving the Komlós conjecture slowly
    Lawrence Hollom
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  20. Centralizers of maps as automorphism groups of Yang--Baxter solutions
    Gigel Militaru
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  21. Finite groups with all involutions fused
    Zheng Guo, Yan Zhou Zhu
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  22. Maximizing Crossword Grids with a Fixed Minimum Clue Length
    Kelly Isham, Abigail Schnitzer
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  23. Exact Agreement Expansion up to the Top via Non-polarity
    Tali Kaufman, Huy Tuan Pham
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  24. The strong fractional choice number can exceed the choice number
    Yangyan Gu, Rongxing Xu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  25. Asymptotically Optimal Weighted Edge Colorings via Local Bin Packing
    Rishikesh Gajjala, Arindam Khan
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv