Red-Blue Clique Partitions and (1-1)-Transversals

[摘要] Motivated by the problem of Gallai on (1-1)-transversals of $2$-intervals, it was proved by the authors in 1969 that if the edges of a complete graph $K$ are colored with red and blue (both colors can appear on an edge) so that there is no monochromatic i

[学科分类] 离散数学和组合数学

[关键词] (1-1)-Transversal;Red-blue clique cover