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

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,014 studies

  1. A new infinite family of covers of complete graphs that admit a half-transitive action of a Suzuki simple group
    Ludmila Yu. Tsiovkina
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  2. Trace-minimal graphs maximizing the number of spanning trees
    Pablo Romero, Louis Petingi
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Existence of uniformly most reliable two-terminal graphs with distance constraints
    Pablo Romero
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. A generalization of pseudocomplementation in semilattices, lattices and posets with 0
    Ivan Chajda, Helmut Länger
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. On Hamilton cycles in quasiprimitive graphs of order 2pq
    Hao Yu, Tianlei Zhou
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  6. Average eccentricity in k-connected tournaments
    Fadekemi Janet Osaye
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  7. Improved Lower Bounds on Tree Covers
    Yu Chen, Shengtang Huang, Zihan Tan +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  8. Mutation-acyclicity in rank four is decidable but not semialgebraic
    Kymani T. K. Armstrong-Williams, Edward Hirst, Blake Jackson +1
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  9. Improved lattice-packing bounds in small dimensions
    Nina Zubrilina
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  10. Computational complexity of the H-coloring problem in cubic graphs
    Vahan Mkrtchyan
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  11. Weak Hurwitz stability of extended Turán expressions for Stirling--Whitney--Riordan and Laguerre polynomials
    Wenle Shi
    arXivPreprintarXiv licenceFull textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  12. P-stable degree sequence regions for bipartite and directed graphs
    Péter L. Erdős, Gábor Lippner, Na'ama Nevo +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  13. Minimum Contagious Sets in Trees with Degree-Proportional Thresholds
    Jeong-Ok Choi, Collin McDevitt
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  14. From skew Combinatorial Nullstellensatz to sharp Ax-Katz congruences and zero counts
    Shuang Li, Xuan Pang, Pingzhi Yuan
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  15. Degree-list Kempe equivalence for 3-connected graphs
    Hongyang Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  16. The Turán number of Berge paths in connected hypergraphs
    Yupei Li, Ruth Luo
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  17. On the Architectural Complexity of Neural Networks
    Nicholas J. Cooper, François G. Meyer, Michael L. Roberts +3
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  18. Generalizing Praeger--Xu graphs
    Zhaochen Ding, Ci Xuan Wu
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  19. Counting transversals in Latin squares over groups of even order
    James A. Davis, Jonathan Jedwab, Ian M. Wanless +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  20. The Schur positivity of Lucas binomial differences
    Lilan Dai, Dun Qiu, Weichen Wang +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  21. The sparse regularity method for graphs with few even-cycle homomorphisms
    Nan Zhang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  22. Antimagic Labeling of Central Digraphs Constructed from Loops
    Raja Rawat
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  23. A characterization of graphs attaining a lower bound on the dissociation number
    Pingshan Li
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  24. On Cayley Graphs of Skew Braces and Their Distances
    Ahmad Syarif Ahdal, Ryan Aziz, Denny Riama Silaban
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  25. Maximum length and size of simultaneous core partitions with distinct parts
    Metin Can Aydemir
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv