Vertex Colorings without Rainbow or Monochromatic Subgraphs
Wayne Goddard, Honghai Xu

TL;DR
This paper explores vertex colorings of graphs that avoid certain rainbow and monochromatic subgraphs, extending previous work by considering more general cases, including the case where the monochromatic subgraph is an edge.
Contribution
It generalizes the study of forbidden rainbow and monochromatic subgraphs in vertex colorings, especially focusing on the case where the monochromatic subgraph is an edge.
Findings
Characterization of colorings avoiding specific rainbow and monochromatic subgraphs
Extension of known results to more general subgraph pairs
New bounds and conditions for forbidden configurations
Abstract
This paper investigates vertex colorings of graphs such that some rainbow subgraph~ and some monochromatic subgraph are forbidden. Previous work focussed on the case that . Here we consider the more general case, especially the case that .
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.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Limits and Structures in Graph Theory
