University of Haifa

output

19922026

most citedThe new world atlas of artificial night sky brightness

1.7k citations

Showing 2002 · math.COShow all

7 papers · 2 filters

math.CO2002

The order of monochromatic subgraphs with a given minimum degree

Yair Caro, Raphael Yuster

Let $G$ be a graph. For a given positive integer $d$ , let $f_{G} (d)$ denote the largest integer $t$ such that in every coloring of the edges of $G$ with two colors there is a monochr…

math.CO2002

Tiling transitive tournaments and their blow-ups

Raphael Yuster

Let $T T_{k}$ denote the transitive tournament on $k$ vertices. Let $T T (h, k)$ denote the graph obtained from $T T_{k}$ by replacing each vertex with an independent set of size $h \geq 1$ …

math.CO2002★ 14 cited

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…

math.CO2002

132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers

Eric S. Egge, Toufik Mansour

In 1990 West conjectured that there are $2 (3 n)! / ((n + 1)! (2 n + 1)!)$ two-stack sortable permutations on $n$ letters. This conjecture was proved analytically by Zeilberger in 1992. Late…

math.CO2002★ 15 cited

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…

math.CO2002

Edge coloring complete uniform hypergraphs with many components

Yair Caro, Raphael Yuster

Let $H$ be a hypergraph. For a $k$ -edge coloring $c : E (H) \to {1, ..., k}$ let $f (H, c)$ be the number of components in the subhypergraph induced by the color class with the least…