Summary: An \(H\)-factor of a graph \(G\) is a spanning subgraph of \(G\) whose connected components are isomorphic to \(H\). Given a properly edge-colored graph \(G\), a rainbow \(H\)-subgraph of \(G\) is an \(H\)-subgraph of \(G\) whose edges have distinct colors. A rainbow \(H\)-factor is an \(H\)-factor whose components are rainbow \(H\)-subgraphs. The following result is proved. If \(H\) is any fixed graph with \(h\) vertices then every properly edge-colored graph with \(hn\) vertices and minimum degree \((1-1/\chi(H))hn+o(n)\) has a rainbow \(H\)-factor.
Recommendations
- Rainbow factors in hypergraphs
- Rainbow \(H\)-factors of complete \(s\)-uniform \(r\)-partite hypergraphs
- Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- Rainbow and properly colored spanning trees in edge-colored bipartite graphs
Cited in
(12)- Rainbow \(H\)-factors of complete \(s\)-uniform \(r\)-partite hypergraphs
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Rainbow factors in hypergraphs
- Properly colored Hamilton cycles in Dirac-type hypergraphs
- Rainbow vertex-connection number on a small-world Farey graph
- On the existence of a rainbow 1‐factor in 1‐factorizations of K
- Rainbow decompositions
- Minimum rainbow \(H\)-decompositions of graphs
- Minimum rainbow \(H\)-decompositions of graphs
- Graph Tilings in Incompatibility Systems
- Rainbow spanning structures in graph and hypergraph systems
- Minimum degree threshold for \(H\)-factors with high discrepancy
This page was built for publication: Rainbow \(H\)-factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q815207)
