Christina Zarb

3 citations · 5 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2016

Two short proofs of the Perfect Forest Theorem

Yair Caro, Josef Lauri, Christina Zarb

A perfect forest is a spanning forest of a connected graph $G$ , all of whose components are induced subgraphs of $G$ and such that all vertices have odd degree in the forest. A per…

math.CO2014★ 1 cited

Degree Monotone Paths and Graph Operations

Yair Caro, Josef Lauri, Christina Zarb

A path $P$ in a graph $G$ is said to be a degree monotone path if the sequence of degrees of the vertices of $P$ in the order in which they appear on $P$ is monotonic. The length o…

math.CO2014

Hamiltonicity and $σ$ -hypergraphs

Christina Zarb

We define and study a special type of hypergraph. A $σ$ -hypergraph $H = H (n, r, q$ $∣$ $σ$ ), where $σ$ is a partition of $r$ , is an $r$ -uniform hypergraph having $n q$ vertices part…

math.CO2014★ 3 cited

Degree Monotone Paths

Yair Caro, Josef Lauri, Christina Zarb

We shall study degree-monotone paths in graphs, a problem inspired by the celebrated theorem of Erd{ő}s-Szekeres concerning the longest monotone subsequence of a given sequence of…

math.CO2014★ 1 cited

Independence and Matchings in $σ$ -hypergraphs

Yair Caro, Josef Lauri, Christina Zarb

Let $σ$ be a partition of the positive integer $r$ . A $σ$ -hypergraph $H = H (n, r, q ∣ σ)$ is an $r$ -uniform hypergraph on $n q$ vertices which are partitioned into $n$ classes $V_1, V_2,…

Two short proofs of the Perfect Forest Theorem

Degree Monotone Paths and Graph Operations

Hamiltonicity and σ-hypergraphs

Degree Monotone Paths

Independence and Matchings in σ-hypergraphs

Hamiltonicity and $σ$ -hypergraphs

Independence and Matchings in $σ$ -hypergraphs