Non-monochromatic triangles in a 2-edge-coloured graph

Abstract: Let

G = (V, E)

be a simple graph and let

R, B

be a partition of

E

. We prove that whenever

| E | + m i n | R |, | B | > | V | c h o o s e 2

, there exists a subgraph of

G

isomorphic to

K_{3}

which contains edges from both

R

and

B

. We conjecture a natural generalization to partitions with more blocks.

Full work available at URL: https://arxiv.org/abs/1809.10088

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

Cites Work

Cited In (5)

This page was built for publication: Non-monochromatic triangles in a 2-edge-coloured graph