Title of article
Ramsey degrees of bipartite graphs: A primitive recursive proof Original Research Article
Author/Authors
W.L. Fouché، نويسنده , , L.M. Pretorius، نويسنده , , C.J. Swanepoel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
9
From page
111
To page
119
Abstract
In this paper, we give a primitive recursive proof for a theorem that provides a measure of the extent to which a finite bipartite graph is a Ramsey object in the class of finite bipartite graphs.
Keywords
Ramsey theory , Bipartite graphs , Ramsey degrees , Partially ordered sets
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948564
Link To Document