1 citations · 1 across the 2 of their papers we have counts for
5 papers · 1 filter
On zero-sum spanning trees and zero-sum connectivity
Yair Caro, Adriana Hansberg, Josef Lauri +1
We consider -colourings of the edges of a graph with colours and in . A subgraph of is said to be a zero-sum…
A note on totally-omnitonal graphs
Yair Caro, Josef Lauri, Christina Zarb
Let the edges of the complete graph be coloured red or blue, and let be a graph with . Then ot(n,G) is defined to be the minimum integer, if it exists, such t…
On small balanceable, strongly-balanceable and omnitonal graphs
Yair Caro, Josef Lauri, Christina Zarb
In Ramsey theory for graphs we are given a graph and we are required to find the least such that, for any , any red/blue colouring of the edges of gives…
Notes on Spreads of Degrees in Graphs
Yair Caro, Josef Lauri, Christina Zarb
Perhaps the very first elementary exercise one encounters in graph theory is the result that any graph on at least two vertices must have at least two vertices with the same degree…
Selective Hypergraph Colourings
Yair Caro, Josef Lauri, Christina Zarb
We look at colourings of -uniform hypergraphs, focusing our attention on unique colourability and gaps in the chromatic spectrum. The pattern of an edge in an -uniform hy…