Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs

DOI10.7155/JGAA.00311zbMath1276.05073OpenAlexW1986804375MaRDI QIDQ2865025

Tapas Kuamr Mishra, Sudebkumar Prasant Pal

Publication date: 28 November 2013

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00311

zbMATH Keywords

bipartite graphRamsey numberprobabilistic methodlocal lemma\(r\)-uniform hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Generalized Ramsey theory (05C55)

Related Items (1)

All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs

This page was built for publication: Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs