Construction, decoding and implementation of F_q linear codes. Performanca of SPC ...
Control software for an ultrasonic measurement system for liquids and characteriza...
Ramsey and anti-Ramsey structures in deterministic and random graphs
Full text | |
Author(s): |
Mota, G. O.
Total Authors: 1
|
Document type: | Journal article |
Source: | SIAM JOURNAL ON DISCRETE MATHEMATICS; v. 33, n. 1, p. 197-208, 2019. |
Web of Science Citations: | 0 |
Abstract | |
We estimate the 3-color bipartite Ramsey number for balanced bipartite graphs H with small bandwidth and bounded maximum degree. More precisely, we show that the minimum v alue of N such that in any 3-edge coloring of K-N,K-N there is a monochromatic copy of H is at most 3/2 + 0(1)vertical bar V (H)vertical bar. In particular, we determine asymptotically the 3-color bipartite Ramsey number for grid graphs. (AU) | |
FAPESP's process: | 18/04876-1 - Ramsey theory, structural graph theory and applications in Bioinformatics |
Grantee: | Guilherme Oliveira Mota |
Support Opportunities: | Research Grants - Young Investigators Grants |