On Some Zarankiewicz Numbers and Bipartite Ramsey Numbers for Quadrilateral
Combinatorics
2021-06-29 v2 Discrete Mathematics
Abstract
The Zarankiewicz number is the maximum number of edges in a subgraph of that does not contain as a subgraph. The bipartite Ramsey number is the least positive integer such that any coloring of the edges of with colors will result in a monochromatic copy of in the -th color, for some , . If for all , then we denote this number by . In this paper we obtain the exact values of some Zarankiewicz numbers for quadrilateral (), and we derive new bounds for diagonal multicolor bipartite Ramsey numbers avoiding quadrilateral. In particular, we prove that , and establish new general lower and upper bounds on .
Keywords
Cite
@article{arxiv.1303.5475,
title = {On Some Zarankiewicz Numbers and Bipartite Ramsey Numbers for Quadrilateral},
author = {Janusz Dybizbański and Tomasz Dzido and Stanisław Radziszowski},
journal= {arXiv preprint arXiv:1303.5475},
year = {2021}
}
Comments
13 pages