![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
European Journal of Combinatorics, Volume 73
Volume 73, October 2018
- Olya Mandelshtam
, Xavier Gérard Viennot:
Rhombic alternative tableaux and assemblées of permutations. 1-19 - Tao Jiang, Yuejian Peng, Biao Wu
:
Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions. 20-36 - Connor Ahlbach
, Joshua P. Swanson
:
Refined cyclic sieving on words for the major index statistic. 37-60 - Jiangmin Pan, Ci Xuan Wu, Fugang Yin
:
Finite edge-primitive graphs of prime valency. 61-71 - Andrey Kupavskii, János Pach, Gábor Tardos:
Tilings with noncongruent triangles. 72-80 - Ervin Györi, Dániel Korándi
, Abhishek Methuku, István Tomon
, Casey Tompkins, Máté Vizer:
On the Turán number of some ordered even cycles. 81-88 - Angèle M. Foley
, Ronald C. King
:
Factorial Q-functions and Tokuyama identities for classical Lie groups. 89-113 - Christian Krattenthaler, Thomas W. Müller:
Motzkin numbers and related sequences modulo powers of 2. 114-137 - István Kovács, Klavdija Kutnar
, Dragan Marusic
, Daniel Pellicer:
On even-closed regular embeddings of graphs. 153-169 - Jirí Fiala, Pavel Klavík
, Jan Kratochvíl
, Roman Nedela:
3-connected reduction for regular graph covers. 170-210 - Ishay Haviv, Dan Levy:
Dioid partitions of groups. 211-230 - Bao-Xuan Zhu
:
q-log-convexity from linear transformations and polynomials with only real zeros. 231-246
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.