105 citations
- Oranim Academic College of EducationIL11 papers
- Carmel (Israel)IL4 papers
- Nankai UniversityCN4 papers
- Technion – Israel Institute of TechnologyIL4 papers
- Centre National de la Recherche ScientifiqueFR3 papers
- Dalian Maritime UniversityCN3 papers
- Hebrew University of JerusalemIL3 papers
- Centrum Wiskunde & InformaticaNL2 papers
- Royal Holloway University of LondonGB2 papers
- University of IcelandIS2 papers
- University of Notre DameUS2 papers
- University UcinfCL2 papers
6 papers · 1 filter
The order of monochromatic subgraphs with a given minimum degree
Yair Caro, Raphael Yuster
Let be a graph. For a given positive integer , let denote the largest integer such that in every coloring of the edges of with two colors there is a monochr…
Tiling transitive tournaments and their blow-ups
Raphael Yuster
Let denote the transitive tournament on vertices. Let denote the graph obtained from by replacing each vertex with an independent set of size …
On multi-avoidance of generalized patterns
T. Mansour, S. Kitaev
In [Kit1] Kitaev discussed simultaneous avoidance of two 3-patterns with no internal dashes, that is, where the patterns correspond to contiguous subwords in a permutation. In thre…
Higher Homotopy Operations
David Blanc, Martin Markl
We provide a general definition of higher homotopy operations, encompassing most known cases, including higher Massey and Whitehead products, and long Toda brackets. These operatio…
132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers
Eric S. Egge, Toufik Mansour
In 1990 West conjectured that there are two-stack sortable permutations on letters. This conjecture was proved analytically by Zeilberger in 1992. Late…
Simultaneous avoidance of generalized patterns
S. Kitaev, T. Mansour
In [BabStein] Babson and Steingr\'ımsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permu…