default search action
European Journal of Combinatorics, Volume 103
Volume 103, June 2022
- Alex Cohen, Frank de Zeeuw:
A Sylvester-Gallai theorem for cubic curves. 103509 - Arvind Ayyer, Philippe Nadeau:
Combinatorics of a disordered two-species ASEP on a torus. 103511 - Oliver Roche-Newton, Audie Warren:
Arcs in Fq2. 103512 - Michael Coopman, Zachary Hamaker:
Involutions under Bruhat order and labeled Motzkin paths. 103513 - Colin Defant, Nathan Williams:
Crystal pop-stack sorting and type A crystal lattices. 103514 - Ali Mohammadi, Giorgis Petridis:
Almost orthogonal subsets of vector spaces over finite fields. 103515 - Lior Gishboliner:
A characterization of easily testable induced digraphs and k-colored graphs. 103516 - Vadim V. Lozin, Igor Razgon:
Tree-width dichotomy. 103517 - Sami Assaf, Stephanie van Willigenburg:
Skew key polynomials and a generalized Littlewood-Richardson rule. 103518 - Dániel Gerbner, Cory Palmer:
Some exact results for generalized Turán problems. 103519 - Scott Baldridge, Louis H. Kauffman, William Rushworth:
On ribbon graphs and virtual links. 103520 - Henri Mühle:
Hochschild lattices and shuffle lattices. 103521 - Koustav Banerjee, Sreerupa Bhattacharjee, Manosij Ghosh Dastidar, Pankaj Jyoti Mahanta, Manjil P. Saikia:
Parity biases in partitions and restricted partitions. 103522 - Ademir Hujdurovic, Klavdija Kutnar, Dragan Marusic, Stefko Miklavic:
On maximum intersecting sets in direct and wreath product of groups. 103523 - Isaac Konan:
The (k, l)-Euler theorem and the combinatorics of (k, l)-sequences. 103524 - Gonçalo Gutierres, Ricardo Mamede, José Luís Santos:
Diameter of the commutation classes graph of a permutation. 103525 - Sherry Sarkar, Pablo Soberón:
Tolerance for colorful Tverberg partitions. 103527
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.