


default search action
European Journal of Combinatorics, Volume 136
Volume 136, 2026
- Emily Barnard, Jean-Christophe Novelli, Vincent Pilaud:

Separating trees and simple congruences of the weak order. 104375 - Jiyong Chen, Cai Heng Li, Ci Xuan Wu, Yan Zhou Zhu:

A construction of 2-arc-transitive non-solvable covers of complete graphs. 104377 - Jack H. Koolen, Hong-Jun Ge, Chenhui Lv, Qianqian Yang:

A Bose-Laskar-Hoffman theory for μ -bounded graphs with fixed smallest eigenvalue. 104378 - Wenkun Wang, Yuejian Peng:

Counting the maximum number of sunflowers in hypergraphs with given matching number. 104379 - Eva-Maria Hainzl

, Élie de Panafieu
:
Tree walks and the spectrum of random graphs. 104386 - Maria Esipova, Jinting Liang, Stephanie van Willigenburg:

Symmetric quasisymmetric Schur-like functions. 104387 - Emanuele Rodaro, Riccardo Venturi

:
The hereditariness problem for the Černý conjecture. 104388 - Jia Xu, Yong Yao:

Majorization and inequalities among complete homogeneous symmetric functions. 104389 - Hyunsoo Cho, Byungchan Kim, Eunmi Kim, Ae Ja Yee:

Inequalities on the total number of t -hooks of partitions. 104390 - George Brooks, William Linz:

Some exact and asymptotic results for hypergraph Turán problems in ℓ 2 -norm. 104391 - Wonwoo Kang

, Kyeongjun Lee, Eunsung Lim:
Unimodality and cluster algebras from surfaces. 104392 - M. A. Khrystik:

Combinatorics on finite words and the length of a finite-dimensional associative algebra. 104393 - Alimzhan Amanov, Damir Yeliussizov:

On equidistribution theorem for plane partitions. 104394 - On-Hei Solomon Lo:

A note on cycles in cyclically 4-edge-connected cubic planar graphs. 104395 - Yongjiang Wu, Yongtao Li, Tingzeng Wu, Lihua Feng:

Non-uniform pairwise cross t-intersecting families. 104396

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














