![](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
Journal of Combinatorial Theory, Series A, Volume 146
Volume 146, February 2017
- Rieuwert J. Blok
, Corneliu G. Hoffman
:
Curtis-Tits groups of simply-laced type. 1-32 - Shashank Kanade, James Lepowsky, Matthew C. Russell, Andrew V. Sills:
Ghost series and a motivated proof of the Andrews-Bressoud identities. 33-62 - James East
, Robert D. Gray:
Diagram monoids and Graham-Houghton graphs: Idempotents and generating sets of ideals. 63-128 - Nicholas A. Loehr:
Variants of the RSK algorithm adapted to combinatorial Macdonald polynomials. 129-164 - Dániel Korándi, Benny Sudakov:
Domination in 3-tournaments. 165-168 - Takuro Abe, Daisuke Suyama
, Shuhei Tsujie
:
The freeness of Ish arrangements. 169-183 - Dmitry Kerner, András Némethi:
A generalized FKG-inequality for compositions. 184-200 - Brendon Rhoades:
Evidence for parking conjectures. 201-238 - Sara C. Billey, Matjaz Konvalinka
, Frederick A. Matsen IV
:
On the enumeration of tanglegrams and tangled chains. 239-263 - Benjamin A. Burton
, Rodney G. Downey:
Courcelle's theorem for triangulations. 264-294 - Dorde Baralic
, Rade T. Zivaljevic
:
Colorful versions of the Lebesgue, KKM, and Hex theorem. 295-311 - Sergey Norin, Liana Yepremyan
:
Turán number of generalized triangles. 312-343 - Cai Heng Li
, Shu Jiao Song
:
Corrigendum to "A characterization of metacirculants" [J. Combin. Theory Ser. A 120 (1) (2013) 39-48]. 344-345
![](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.