default search action
Journal of Combinatorial Theory, Series A, Volume 189
Volume 189, July 2022
- Joanna Chybowska-Sokól, Michal Debski, Jaroslaw Grytczuk, Konstanty Junosza-Szaniawski, Barbara Nayar, Urszula Pastwa, Krzysztof Wesek:
Fractional meanings of nonrepetitiveness. 105598 - Michael Fuchs, Guan-Ru Yu, Louxin Zhang:
Asymptotic enumeration and distributional properties of galled networks. 105599 - Jia-Li Du, Yan-Quan Feng, Pablo Spiga:
On n-partite digraphical representations of finite groups. 105606 - Evgeny Bespalov:
On the non-existence of extended 1-perfect codes and MDS codes. 105607 - Kai Zheng:
On the e-positivity of trees and spiders. 105608 - Daniele Bartoli, Giacomo Micheli, Giovanni Zini, Ferdinando Zullo:
r-fat linearized polynomials over finite fields. 105609 - Mauro Di Nasso:
Infinite monochromatic patterns in the integers. 105610 - Andrea C. Burgess, Peter Danziger, Tommaso Traetta:
On the Oberwolfach problem for single-flip 2-factors via graceful labelings. 105611 - George E. Andrews, Shane Chern, Zhitai Li:
Linked partition ideals and the Alladi-Schur theorem. 105614 - Martin Dolezal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhon:
Cut distance identifying graphon parameters over weak* limits. 105615 - Yuan Ren, Dongchun Han:
On equivalent classes of minimal Abelian codes. 105616 - Yongke Qu, Yuanlin Li, Daniel Teeuwsen:
On a conjecture of the small Davenport constant for finite groups. 105617 - Andreas F. Holmsen, Seunghun Lee:
Leray numbers of complexes of graphs with bounded matching number. 105618 - Josse van Dobben de Bruyn, Harry Smit, Marieke van der Wegen:
Discrete and metric divisorial gonality can be different. 105619 - Josko Mandic, Aljosa Subasic:
Flag-transitive and point-imprimitive symmetric designs with λ ≤ 10. 105620
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.