Bipartite Graphs and Monochromatic Squares

Shimon Garti

doi:https://doi.org/10.1007/s11083-018-9457-4

Bipartite Graphs and Monochromatic Squares

Research output: Contribution to journal › Article › peer-review

Abstract

Let κ be a successor cardinal. We prove that consistently every bipartite graph of size κ ⁺ × κ ⁺ contains either an independent set or a clique of size τ × τ for every ordinal τ < κ ⁺ . We prove a similar theorem for ℓ-partite graphs.

Original language	American English
Pages (from-to)	99-106
Number of pages	8
Journal	Order
Volume	36
Issue number	1
DOIs	https://doi.org/10.1007/s11083-018-9457-4
State	Published - 15 Mar 2019
Externally published	Yes

Keywords

Bipartite graph
Polarized relation
Saturated ideals

All Science Journal Classification (ASJC) codes

Algebra and Number Theory
Geometry and Topology
Computational Theory and Mathematics

Access to Document

https://doi.org/10.1007/s11083-018-9457-4

Cite this

@article{cbdd75c345844e8196592e7df814aa5c,

title = "Bipartite Graphs and Monochromatic Squares",

abstract = " Let κ be a successor cardinal. We prove that consistently every bipartite graph of size κ + × κ + contains either an independent set or a clique of size τ × τ for every ordinal τ < κ + . We prove a similar theorem for ℓ-partite graphs.",

keywords = "Bipartite graph, Polarized relation, Saturated ideals",

author = "Shimon Garti",

note = "Publisher Copyright: {\textcopyright} 2018, Springer Science+Business Media B.V., part of Springer Nature.",

year = "2019",

month = mar,

day = "15",

doi = "https://doi.org/10.1007/s11083-018-9457-4",

language = "American English",

volume = "36",

pages = "99--106",

journal = "Order",

issn = "0167-8094",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Bipartite Graphs and Monochromatic Squares

AU - Garti, Shimon

PY - 2019/3/15

Y1 - 2019/3/15

N2 - Let κ be a successor cardinal. We prove that consistently every bipartite graph of size κ + × κ + contains either an independent set or a clique of size τ × τ for every ordinal τ < κ + . We prove a similar theorem for ℓ-partite graphs.

AB - Let κ be a successor cardinal. We prove that consistently every bipartite graph of size κ + × κ + contains either an independent set or a clique of size τ × τ for every ordinal τ < κ + . We prove a similar theorem for ℓ-partite graphs.

KW - Bipartite graph

KW - Polarized relation

KW - Saturated ideals

UR - http://www.scopus.com/inward/record.url?scp=85044447384&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/s11083-018-9457-4

DO - https://doi.org/10.1007/s11083-018-9457-4

M3 - Article

SN - 0167-8094

VL - 36

SP - 99

EP - 106

JO - Order

JF - Order

IS - 1

ER -

Bipartite Graphs and Monochromatic Squares

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this