3 citations · 6 across the 5 of their papers we have counts for
5 papers
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 , all of whose components are induced subgraphs of and such that all vertices have odd degree in the forest. A per…
Degree Monotone Paths and Graph Operations
Yair Caro, Josef Lauri, Christina Zarb
A path in a graph is said to be a degree monotone path if the sequence of degrees of the vertices of in the order in which they appear on is monotonic. The length o…
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…
Independence and Matchings in -hypergraphs
Yair Caro, Josef Lauri, Christina Zarb
Let be a partition of the positive integer . A -hypergraph is an -uniform hypergraph on vertices which are partitioned into classes $V_1, V_2,…
A Generalisation of Isomorphisms with Applications
Josef Lauri, Russell Mizzi, Raffaele Scapellato
In this paper, we study the behaviour of TF-isomorphisms, a natural generalisation of isomorphisms. TF-isomorphisms allow us to simplify the approach to seemingly unrelated problem…