On Ramsey minimal graphs (Q5906707)
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 741545
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Ramsey minimal graphs |
scientific article; zbMATH DE number 741545 |
Statements
On Ramsey minimal graphs (English)
0 references
6 April 1995
0 references
Summary: An elementary probabilistic argument is presented which shows that for every forest \(F\) other than a matching, and every graph \(G\) containing a cycle, there exists an infinite number of graphs \(J\) such that \(J\to (F, G)\) but if we delete from \(J\) any edge \(e\) the graph \(J-e\) obtained in this way does not have this property.
0 references
Ramsey minimal graphs
0 references
forest
0 references
cycle
0 references
0.838367760181427
0 references
0.8206270337104797
0 references
0.8110901117324829
0 references
