Bipartite graphs and monochromatic squares
classification
🧮 math.LO
math.CO
keywords
kappabipartiteeverysizetimescardinalcliqueconsistently
read the original abstract
We prove that consistently every bipartite graph of size $\kappa^+\times\kappa^+$ contains either a clique or an independent subset of size $\tau\times\tau$ for every $\tau\in\kappa^+$, where $\kappa$ is a successor cardinal.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.