4 citations · 16 across the 19 of their papers we have counts for
8 papers · 2 filters
The Saturation Number for the length of Degree Monotone Paths
Yair Caro, Josef Lauri, Christina Zarb
A degree monotone path in a graph is a path such that the sequence of degrees of the vertices in the order in which they appear on is monotonic. The length of the longe…
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…
-colourings and clique-free -hypergraphs
Yair Caro, Josef Lauri, Christina Zarb
We consider vertex colourings of -uniform hypergraphs in the classical sense, that is such that no edge has all its vertices given the same colour, and -colourings of…