scientific article; zbMATH DE number 3970796

From MaRDI portal
Publication:3737463





Let F and G be finite graphs. We write \(F\to G\) to indicate that the following holds: if the edges of F are colored with two colors red and blue then there is a subgraph of F isomorphic to G with all of its edges colored with the same color. We write \(F\rightarrowtail G\) if subgraph is replaced by induced subgraph in the above definition. For a given graph G, one may define \(R^*(G)\) to be the set of minimal graphs in \(\{F\mid F\to G\}\) and \(R^{**}(G)\) to be the set of minimal graphs in \(\{F\mid F\rightarrowtail G\}.\) The main results of this paper are: If G is two connected then \(R^{**}(G)\) is infinite, and if G is two connected and if the removal of two nonadjacent vertices cannot disconnect the graph, then \(R^*(G)\) is infinite.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3737463)