Skip to content
DraconiticResearch
Search Sources API
209,932 studies31 sourcesUpdated 26 min ago

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,167 studies

  1. Structural and computational aspects of majority coloring games
    Yash Chawda, Saraswati Girish Nanoti, Brahadeesh Sankarnarayanan +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. Weighted coloop splittings in rank six
    James Dylan Douthitt, Lee Kennard, Josef Komissar
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  3. Connected graphs with minimum adjacency spectral gap
    Lele Liu, Michael Tait, Yi Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. Forbidden subposet problems in the linear lattice
    Balázs Patkós, Casey Tompkins
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Extremal hypergraphs without generalized 4-cycles
    Hao Huang, Jie Ma, Tianchi Yang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  6. Lorentzian polynomials and log-concavity of the independence polynomials of graphs
    Lily Li Liu, Hongyue Tang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  7. Real-rootedness and ultra log-concavity of rank-two matroid Ehrhart h*-polynomials
    Houshan Fu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  8. A counterexample to Nagamochi's scoring lemma and a new rectangle packing bound
    Hakan Karakuş
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  9. Generalized Turán problems for shorter even cycles
    Zhen Liu, Chuanshu Wu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  10. Perfect Matching in k-Partite k-Uniform Hypergraphs
    Jie Han, Hongliang Lu, Bin Wang +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  11. The small Davenport constant of E2× C3r for 0≤ r≤3
    Andreas Volkmann
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  12. A counterexample to the Fang--Lin conjecture: Edge and spectral extremality diverge near a Turán graph
    Qi Wu, Yong Lu
    arXivPreprintCC0Full textCombinatorics & discrete mathematicsarXiv
  13. An equivalent form of Hindman's Theorem
    Lorenzo Carlucci, Andrea D'Amico
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsLogic & foundationsarXiv
  14. Part Size Count in Cylindric Partitions and Bijections for Small Profiles
    Kağan Kurşungöz, Halime Ömrüuzun Seyrek
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  15. The Reach of Abelian Covers in Hypergraphs
    Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  16. Weak and strong Lefschetz properties for vertex cover Artinian algebras associated to graphs
    Trung Chau, Tran Quang Hoa, Dang Thi Kieu Uyen
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  17. On the nonnegativity of monomial immanants for hook partitions
    Xiangshuai Dong, Tingzeng Wu, Xing Gao
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  18. Block-Transitive $5−(v,k,2)$ Designs with k divides v
    Huijiao Hu, Zheng Huang, Shouqiang Shen
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  19. Degree conditions for k-strong orientations of digraphs
    Jørgen Bang-Jensen, Shuo Wei
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  20. Most Aα-eigenvalues of a tree are small
    Elvia P. Barturén, Elismar R. Oliveira
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  21. Sets of cardinality seven are not sum-dominant
    Thai Duong Do, Van Thien Nguyen
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  22. Flip-packability: uniform characterisations of tame graph classes
    Ioannis Eleftheriadis
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsLogic & foundationsarXiv
  23. Riesz kernels of hyperbolic polynomials: positivity, admissible exponents and Jordan rigidity
    Dongsheng Wei
    arXivPreprintarXiv licenceFull textAlgebra & number theoryAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  24. Exact-palette rainbow embeddings in uniformly coloured pseudorandom graphs
    Elad Aigner-Horev, Dan Hefetz, Yury Person +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  25. Quasi-Fuchsian groups and complex realisations of q-deformed real numbers
    Alex Elzenaar
    arXivPreprintarXiv licenceFull textAlgebra & number theoryAnalysis & PDEsCombinatorics & discrete mathematicsarXiv