1.7k citations
- Technion – Israel Institute of TechnologyIL151 papers
- Oranim Academic College of EducationIL134 papers
- Tel Aviv UniversityIL55 papers
- Heidelberg UniversityDE36 papers
- Carmel (Israel)IL29 papers
- Columbia UniversityUS25 papers
- Massachusetts Institute of TechnologyUS25 papers
- National Research University Higher School of EconomicsRU25 papers
- University of AmsterdamNL22 papers
- Hebrew University of JerusalemIL21 papers
- Princeton UniversityUS21 papers
- Centre National de la Recherche ScientifiqueFR20 papers
5 papers · 2 filters
Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs
Raphael Yuster
We prove that every Eulerian orientation of contains arc-disjoint directed 4-cycles, improving earlier lower bounds. Combined with a prob…
Finite automata and pattern avoidance in words
Petter Brändén, Toufik Mansour
We say that a word on a totally ordered alphabet avoids the word if there are no subsequences in order-equivalent to . In this paper we suggest a new approach to the…
Dense graphs are antimagic
N. Alon, G. Kaplan, A. Lev +2
An {\em antimagic labeling} of a graph with edges and vertices is a bijection from the set of edges to the integers such that all vertex sums are pairwise dis…
The number of edge disjoint transitive triples in a tournament
Raphael Yuster
We prove that a tournament with vertices has more than edge-disjoint transitive triples. We also prove some results on the existence of large packings of -…
Periodic de Bruijn triangles: exact and asymptotic results
B. Shapiro, M. Shapiro, A. Vainshtein
We study the distribution of the number of permutations with a given periodic up-down sequence w.r.t. the last entry, find exponential generating functions and prove asymptotic for…