4 citations · 16 across the 19 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
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…
math.CO2019
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…