Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles

02/13/2022
by   Patrick Arras, et al.
0

In 2019, Letzter confirmed a conjecture of Balogh, Barát, Gerbner, Gyárfás and Sárközy, proving that every large 2-edge-coloured graph G on n vertices with minimum degree at least 3n/4 can be partitioned into two monochromatic cycles of different colours. Here, we propose a weaker condition on the degree sequence of G to also guarantee such a partition and prove an approximate version. Continuing work by Allen, Böttcher, Lang, Skokan and Stein, we also show that if deg(u) + deg(v) ≥ 4n/3 + o(n) holds for all non-adjacent vertices u,v ∈ V(G), then all but o(n) vertices can be partitioned into three monochromatic cycles.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/22/2020

Constructing minimally 3-connected graphs

A 3-connected graph is minimally 3-connected if removal of any edge dest...
research
07/08/2022

The Burning Number Conjecture Holds Asymptotically

The burning number b(G) of a graph G is the smallest number of turns req...
research
07/09/2021

Adaptable and conflict colouring multigraphs with no cycles of length three or four

The adaptable choosability of a multigraph G, denoted ch_a(G), is the sm...
research
11/15/2021

Metric dimension on sparse graphs and its applications to zero forcing sets

The metric dimension dim(G) of a graph G is the minimum cardinality of a...
research
08/05/2021

Generalized splines on graphs with two labels and polynomial splines on cycles

A generalized spline on a graph G with edges labeled by ideals in a ring...
research
03/16/2019

A Partition-centric Distributed Algorithm for Identifying Euler Circuits in Large Graphs

Finding the Eulerian circuit in graphs is a classic problem, but inadequ...
research
08/14/2018

Addressing Johnson graphs, complete multipartite graphs, odd cycles and other graphs

Graham and Pollak showed that the vertices of any graph G can be address...

Please sign up or login with your details

Forgot password? Click here to reset