No label defined (Q3737463)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3970796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3970796 |
Statements
1986
0 references
set of minimal graphs
0 references
0.8782621026039124
0 references
0.8611190319061279
0 references
0.8387273550033569
0 references
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.
0 references