Ramsey degrees of bipartite graphs: A primitive recursive proof

doi:10.1016/j.disc.2004.08.035

Discrete Mathematics

Volume 293, Issues 1–3, 6 April 2005, Pages 111-119

https://doi.org/10.1016/j.disc.2004.08.035 Get rights and content

Under an Elsevier user license

open archive

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.

MSC

05D10

06A07

05C35

Keywords

Ramsey theory

Bipartite graphs

Ramsey degrees

Partially ordered sets