The Ramsey size number of dipaths
type: Item
instance of: scholarly article
title: The Ramsey size number of dipaths
zbMATH Open document ID: 1012.05116
DOI: 10.1016/S0012-365X(02)00396-5
author: David Reimer
published in: Discrete Mathematics
publication date: 2002-12-02T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 1838984
Wikidata QID: Q105583782
reviewed by: Jack E. Graver
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1838984