Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 23 min ago

Combinatorics & discrete mathematics

4,014 studies198 in 7 days1,616 in 30 days

Filters
Type
Date
Clear

Latest

4,014 studies

  1. An overview of universal obstructions for graph parameters
    Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos
    Discrete Applied MathematicsPeer-reviewedLicence not statedFull textCombinatorics & discrete mathematicsHAL
  2. Diagrams for Roots and Quiver Representations in the context of the Gabriel-Kac Theorem
    Jacob Canel
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  3. Enumeration Complexity of Permutation Classes
    Manuel Bodirsky, Mohamed Elsheikh
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. Generalised hyperbolic polynomials: combinatorial interpretation and real-rootedness
    Bishal Deb
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  5. High-chromatic tournament parts without a complete pair of cyclic triangles
    Guantao Chen, Hein van der Holst, Shengze Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  6. Finite-Sample Optimal Conformal Prediction Sets under Covariate Shift
    Zhongyang Li
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityStatisticsarXiv
  7. Ternary analogs of dendriform algebras and quadri-algebras
    Yu Hin, Au, Murray R. Bremner
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  8. Homotopy types and torsion in homology of generalized chessboard complexes
    Ivan Limonchenko, Seonghyeon Yu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  9. Local-to-Global Theorems Based on Cones with Applications to Graph Coloring
    Anqi Li, Shayan Oveis Gharan
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  10. Refinements on the Restriction and Kakeya problems range in ℝ4
    Tiago Moreira
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  11. Arc Kayles is PSPACE-complete
    Édouard Bonnet
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  12. Existence of regular sets in circulant quartic graphs: a complete characterization
    A. Abdollahi, J. Bagherian, F. Jafari +3
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  13. The list size of random linear and LDPC codes at capacity
    Shashwat Silas
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  14. A study on Type-2 isomorphic circulant graphs. Part 8: Isomorphism series, digraph and graph of Cn(R)
    V. Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  15. A Study on Type-2 Isomorphic Circulant Graphs: Part 7: C432(R), C6750(S) - each has 2 types of Type-2 isomorphic circulant graphs
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  16. A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 & -2 isomorphic circulant graphs
    Vilfred Kamalappan, Wilson Peraprakash
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  17. A study on Type-2 isomorphic circulant graphs. Part 6: Abelian groups (T2n,m(Cn(R)), ∘) and (Vn,m(Cn(R)), ∘)
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  18. A study on Type-2 isomorphic circulant graphs. Part 4: 960 triples of Type-2 isomorphic circulant graphs C54(R)
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  19. A study on Type-2 isomorphic circulant graphs. Part 5: Type-2 isomorphic circulant graphs of orders 48, 81, 96
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  20. A study on Type-2 isomorphic circulant graphs. Part 3: 384 pairs of Type-2 isomorphic circulant graphs C32(R)
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  21. A study on Type-2 isomorphic circulant graphs. Part 1: Type-2 isomorphic circulant graphs Cn(R) w.r.t. m = 2
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  22. Hodge--Riemann relations for nef bundles
    Enhan Li, Weizhe Zheng
  23. Generic tensor products are not maximal
    Mykhaylo Tyomkyn
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  24. A cubic chromatic bound for capped graphs
    Hongyang Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  25. The packing and covering number of trees are local
    Caelan Atamanchuk, Simon Briend, Serte Donderwinkel +1
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv