On Ramsey graphs without bipartite subgraphs (Q1197030): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(92)90605-f / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2080652794 / rank | |||
Normal rank |
Latest revision as of 11:13, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Ramsey graphs without bipartite subgraphs |
scientific article |
Statements
On Ramsey graphs without bipartite subgraphs (English)
0 references
16 January 1993
0 references
Let \(G\) and \(H\) be graphs; the autors write \(G\to(H)\) to indicate that, given any 2-coloring of the edges of \(G\), there exists a monochromatic subgraph \(G\) isomorphic to \(H\). The main result of this paper is: Theorem 4. Let \(m,n\leq 2\) be positive integers. Then for every triangle- free graph \(H\) without \(K_{m,n}\) there exists a triangle-free graph \(G\) without \(K_{m,n}\) so that \(G\to(H)\). If \(H\) is bipartite, then \(G\) may be chosen to be bipartite.
0 references
Ramsey graphs
0 references
bipartite graphs
0 references
triangle-free graph
0 references