Vertex covers by monochromatic pieces - A survey of results and problems
Andras Gyarfas
TL;DR
This survey reviews various problems and results related to covering vertices of edge-colored graphs and hypergraphs with monochromatic structures like paths and cycles, highlighting key open problems and recent advances.
Contribution
It compiles and discusses existing results and open problems on monochromatic vertex covers in edge-colored graphs and hypergraphs, serving as a comprehensive resource.
Findings
Summarizes key results on monochromatic coverings in edge-colored graphs.
Identifies major open problems in the area.
Provides an overview of recent research developments.
Abstract
This survey is devoted to problems and results concerning covering the vertices of edge colored graphs or hypergraphs with monochromatic paths, cycles and other objects. It is an expanded version of the talk with the same title at the Seventh Cracow Conference on Graph Theory, held in Rytro in September 14-19, 2014.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.