Preorder induced by rainbow forbidden subgraphs
Shun-ichi Maezawa, Akira Saito

TL;DR
This paper explores the preorder relation between graphs based on rainbow subgraph containment in edge-colored complete graphs, focusing on pairs of graphs that are not subgraphs of each other and characterizing their structure.
Contribution
It extends previous work by analyzing pairs of graphs with no subgraph relation under the rainbow containment preorder, revealing many such pairs and studying their properties.
Findings
Many such pairs $(H_1, H_2)$ exist with $H_1 subseteq H_2$ and $H_2 subseteq H_1$.
The structure of these pairs under the rainbow containment preorder is characterized.
The paper generalizes the understanding of rainbow subgraph relations beyond subgraph inclusion.
Abstract
A subgraph of an edge-colored graph is rainbow if all the edges of receive different colors. If does not contain a rainbow subgraph isomorphic to , we say that is rainbow -free. For connected graphs and , if every rainbow -free edge-colored complete graph colored in sufficiently many colors is rainbow -free, we write . The binary relation is reflexive and transitive, and hence it is a preorder. If is a subgraph of , then trivially holds. On the other hand, there exists a pair such that is a proper supergraph of and holds. Cui et al.~[Discrete Math.~\textbf{344} (2021) Article Number 112267] characterized these pairs. In this paper, we investigate the pairs with when neither nor is a subgraph of the other. We prove that there…
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
Topicsgraph theory and CDMA systems · Graph Labeling and Dimension Problems · Limits and Structures in Graph Theory
