University of Haifa

output

19922026

most citedThe new world atlas of artificial night sky brightness

1.7k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2015 · math.COShow all

8 papers · 2 filters

math.CO2015

Cliques in the union of $C_{4}$ -free graphs

Abeer Othman, Eli Berger

Let $B$ and $R$ be two simple graphs with vertex set $V$ , and let $G (B, R)$ be the simple graph with vertex set $V$ , in which two vertices are adjacent if they are adjacent in at le…

math.CO2015★ 3 cited

Boundaries of Hypertrees, and Hamiltonian Cycles in Simplicial Complexes

Rogers Mathew, Ilan Newman, Yuri Rabinovich +1

A $d$ -hypertree on $[n]$ is a maximal acyclic $d$ -dimensional simplicial complex with full $(d - 1)$ -skeleton on the vertex set $[n]$ . Alternatively, in the language of algebraic top…

math.CO2015★ 1 cited

Selective Hypergraph Colourings

Yair Caro, Josef Lauri, Christina Zarb

We look at colourings of $r$ -uniform hypergraphs, focusing our attention on unique colourability and gaps in the chromatic spectrum. The pattern of an edge $E$ in an $r$ -uniform hy…

math.CO2015

Ramsey numbers for degree monotone paths

Yair Caro, Raphael Yuster, Christina Zarb

A path $v_{1}, v_{2}, \dots, v_{m}$ in a graph $G$ is $d e g r ee$ - $m o n o t o n e$ if $d e g (v_{1}) \leq d e g (v_{2}) \leq \dots \leq d e g (v_{m})$ where $d e g (v_{i})$ is the degree of $v_{i}$ in $G$ . Longest degr…

math.CO2015★ 1 cited

On Connectivity of the Facet Graphs of Simplicial Complexes

Ilan I. Newman, Yuri Rabinovich

The paper studies the connectivity properties of facet graphs of simplicial complexes of combinatorial interest. In particular, it is shown that the facet graphs of $d$ -cycles, $d$ …

math.CO2015

Log-concavity of the genus polynomials of Ringel ladders

J. L. Gross, T. Mansour, T. W. Tucker +1

A Ringel ladder can be formed by a self-bar-amalgamation operation on a symmetric ladder, that is, by joining the root vertices on its end-rungs. The present authors have previousl…

math.CO2015

Iterated claws have real-rooted genus polynomials

J. L. Gross, T. Mansour, T. W. Tucker +1

We prove that the genus polynomials of the graphs called iterated claws are real-rooted. This continues our work directed toward the 25-year-old conjecture that the genus distribut…

math.CO2015★ 3 cited

On colored set partitions of type $B_{n}$

David G. L. Wang

Generalizing Reiner's notion of set partitions of type $B_{n}$ , we define colored $B_{n}$ -partitions by coloring the elements in and not in the zero-block respectively. Considering the…

Cliques in the union of C4​-free graphs

Boundaries of Hypertrees, and Hamiltonian Cycles in Simplicial Complexes

Selective Hypergraph Colourings

Ramsey numbers for degree monotone paths

On Connectivity of the Facet Graphs of Simplicial Complexes

Log-concavity of the genus polynomials of Ringel ladders

Iterated claws have real-rooted genus polynomials

On colored set partitions of type Bn​

Cliques in the union of $C_{4}$ -free graphs

On colored set partitions of type $B_{n}$