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

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,014 studies

  1. Strong edge-colourings of truncations of cubic graphs
    Domenico Labbate, Federico Romaniello
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Alcove walks, crystal structure and a Levi branching rule
    Wenzhuo Wang
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  3. Revisiting the directed pathwidth of h-semicomplete digraphs
    Guilherme C. M. Gomes, Raul Lopes, Matthias Mnich
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. The Alon-Tarsi number of 4-regular circulant graphs
    Xinbo Xu, Xuding Zhu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. Bethe Hessian Recovery through the Kesten-Stigum Regime
    Dingding Dong, Theo McKenzie
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityStatisticsarXiv
  6. Ore-degree conditions for hypergraph matchings
    Mingyang Guo, Tianhong Kan, Hongliang Lu +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  7. Bounds on the maximum denominator of fractional chromatic numbers
    Xinbo Xu, Xuding Zhu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  8. Maximum edge overlap between independent random regular graphs
    Andrea D'Ascenzo, Riccardo Michielan
    arXivPreprintCC BY-SA 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  9. An extension of the classic Buneman theorem from phylogenetic trees to networks
    Mirko Wilde, Mareike Fischer
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  10. CRCs in four-dimensional lattice graphs
    Ivan Mogilnykh
    arXivPreprintCC0Full textCombinatorics & discrete mathematicsarXiv
  11. Exchange graphs and g-vectors of surface rigid algebras
    Ping He, Bo Le
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  12. Proper conflict-free degree-choosability of graphs with maximum average degree less than 8/3
    Huijuan Xu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  13. Numerical Kawamata--Viehweg vanishing for rank-three matroids
    Ronnie Cheng
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  14. List 3-Coloring in tame classes of graphs in quasipolynomial time
    Paweł Rzążewski
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  15. On sparse universally rigid graphs in ℝ
    Ole Gabsdil, Ezra Hirschi, Julien Portier
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  16. A Fan-Type Theorem for Hamiltonian Berge Cycles in 3-Uniform Hypergraphs
    Ailian Chen, Yanqiang Liu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  17. Perfect state transfer on unicyclic graphs
    Xingkun Song
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  18. Haiman's conjecture for n <= 10: Kazhdan-Lusztig positivity of monomial immanants
    Keith McNulty
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  19. On t-designs supported by self-orthogonal codes
    Masaaki Harada
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  20. Equivariant Ehrhart series for rational simplices and rational cross-polytopes
    Ryo Uchiumi
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  21. Sink polynomials of line graphs and weighted matching polynomials
    Per Alexandersson, Leonardo Saud Maia Leite
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  22. The lattice of antichains of intervals: Dyck paths, level sets, and sweep dimension
    Paolo Boldi, Sebastiano Vigna
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  23. New results on openly disjoint cycles in regular digraphs
    Bin Chen, Wenshen Wu, Meishaung Chen
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  24. Kr-Packings in Graphs with tr−1(n)+k Edges
    Hanzhi Bai, Fuhong Ma, Jin Yan
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  25. Two-coloring the points of a projective plane
    Aart Blokhuis, Ádám Markó, Tamás Szőnyi +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv