Article ID Journal Published Year Pages File Type
9513460 Discrete Mathematics 2005 9 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Ramsey degrees of bipartite graphs: A primitive recursive proof
Authors
, , ,