The Ramsey size number of dipaths (Q1850004): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Jack E. Graver / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Jack E. Graver / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 04:55, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Ramsey size number of dipaths |
scientific article |
Statements
The Ramsey size number of dipaths (English)
0 references
2 December 2002
0 references
Let \(H\) be a finite graph. The Ramsey size number of \(H\), \(\widehat r(H,H)\), is the minimum number of edges required to construct a graph such that when its edges are 2-colored it contains a monochromatic subgraph isomorphic to \(H\). The main result of this paper is Theorem 1: \({(n-5/2)^2\over 2}\leq\widehat r(\vec P_n,\vec P_n)\), where \(\vec P_n\) denotes the directed path with \(n\) edges.
0 references
