Skip to content
DraconiticResearch
Search Sources API
210,418 studies31 sourcesUpdated 5 min ago

Combinatorics & discrete mathematics

4,165 studies279 in 7 days1,725 in 30 days

Filters
Type
Date
Clear

Latest

4,165 studies

  1. Multiplicity bounds for nonzero upper-Laplacian eigenvalues of simplicial complexes
    Vinayak Gupta
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. On Alon's problem concerning the difference between connected domination number and domination number
    Chengli Li, Bo Zhou
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Every graph is eventually Turán-good and Turán-stable
    Jiabao Yang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. The Last Isolated Vertex in Random-Order Uncovering of Cycles and Their Powers: Exact Enumeration and Weibull Limits
    Igor Kleiner
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  5. On a conjecture concerning antipodal labelings for cycles
    John M. Campbell
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  6. Exact Diameter Windows for Random Cayley Graphs on Odd-Order Abelian Groups
    Yao Zhi
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  7. The giant component of complex hypergraphs: automated generating function calculations
    Alexei Vazquez
    arXivPreprintCC BY-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  8. Blocky Matrices and Group Idempotents
    Gaia Carenini
    arXivPreprintCC BY-NC-ND 4.0Full textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  9. A bandwidth refinement of the Erdős distinct subset sums bound
    Simone Costa, Stefano Della Fiore
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  10. The Maximum Permanent of a Stochastic Matrix of Bounded Rank
    Yair Lavi
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  11. Resultant of an equivariant polynomial system with respect to the reflection group G(r,n)
    Sonagnon Julien Owolabi, Ibrahim Nonkané, Joel Tossa
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  12. A cardinal trichotomy for topological equivalence classes of countable trees
    Qi Wu, Yong Lu
    arXivPreprintCC0Full textCombinatorics & discrete mathematicsLogic & foundationsarXiv
  13. A proof of the Holmes-Holroyd-Ramirez cyclic-product conjecture
    Paata Ivanisvili, Shengtong Zhang
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  14. An Approximate Version of Vu's Theorem on Economical Subbases For Non-Integer Exponents
    Ataleshvara Bhargava
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  15. On a problem concerning ℤ3-Ramsey numbers
    Cheng Chi, Jialin He
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  16. Incidence Rank and Bounded Defect for Linear Hypergraphs with Cograph Line Graphs
    Mahesh Ramani
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  17. Sparse chromatic graphs and the complete-graph triangle bound
    Shuyan Chen
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  18. First Subconstituents of Orthogonal Graphs in Even Characteristic:Automorphisms, Cliques, Cores, and Binary Triple Transitivity
    Kai Zhou, Hongfeng Wu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  19. First-Order Laws for Random Geometric Graphs on the Torus
    Simi Haber, Mostafa Mirabi, Saharon Shelah
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsLogic & foundationsProbabilityarXiv
  20. The Scaling Window of Random k-SAT
    Gaia Carenini
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  21. A Sharp Product Bound for Disjoint Cross-Intersecting 3-Graphs with Covering Number Three
    Arthur F. Ramos, David B. Hulak, Ruy J. G. B. de Queiroz
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  22. Random Width and Brightness: Polyhedral Density Theory, Reconstruction, and Gaussian Identifiability
    Omri Abas
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyProbabilityarXiv
  23. Hypergraph Universality and Erdos-Posa Failure for Chromatically Rich Odd Cycles
    Shuyan Chen
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  24. Edges of the uniform random forest of Kn are pairwise negatively correlated for every n
    Anish Gupta
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  25. A rate for the average vacancy of uniformly random matchings in linear hypergraphs
    Anish Gupta
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv