Ramsey degrees of bipartite graphs: a primitive recursive proof

DOI10.1016/j.disc.2004.08.035zbMath1063.05128OpenAlexW1968591785MaRDI QIDQ1779487

C. J. Swanepoel, Lou M. Pretorius, Willem L. Fouché

Publication date: 1 June 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.08.035

zbMATH Keywords

Ramsey theoryRamsey degreesBipartite graphsPartially ordered sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Ramsey theory (05D10)

Related Items

Subrecursive Complexity of Identifying the Ramsey Structure of Posets

Cites Work

• Unnamed Item
• Ramsey classes of set systems
• The partite construction and Ramsey set systems
• Partitions of finite relational and set systems
• Symmetry and the Ramsey degrees of finite relational structures
• Symmetries and Ramsey properties of trees
• Symmetry and the Ramsey degree of posets
• Primitive Recursive Bounds for Van Der Waerden Numbers
• Regularity and Positional Games
• Models Without Indiscernibles
• Ramsey's Theorem for n-Parameter Sets