### Abstract

It is shown that there is a graph L with n vertices and at least n^{1.36} edges such that it contains neither L_{3} nor K_{2, 3} but every subgraph with 2n^{ 4 3}(log n)^{2} edges contains a C_{4}, (n > n_{O}). Moreover, chromatic number of G is at least n^{0.1}.

Original language | English |
---|---|

Pages (from-to) | 407-410 |

Number of pages | 4 |

Journal | Discrete Mathematics |

Volume | 126 |

Issue number | 1-3 |

DOIs | |

Publication status | Published - Mar 1 1994 |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

*Discrete Mathematics*,

*126*(1-3), 407-410. https://doi.org/10.1016/0012-365X(94)90287-9

**Random Ramsey graphs for the four-cycle.** / Füredi, Z.

Research output: Contribution to journal › Article

*Discrete Mathematics*, vol. 126, no. 1-3, pp. 407-410. https://doi.org/10.1016/0012-365X(94)90287-9

}

TY - JOUR

T1 - Random Ramsey graphs for the four-cycle

AU - Füredi, Z.

PY - 1994/3/1

Y1 - 1994/3/1

N2 - It is shown that there is a graph L with n vertices and at least n1.36 edges such that it contains neither L3 nor K2, 3 but every subgraph with 2n 4 3(log n)2 edges contains a C4, (n > nO). Moreover, chromatic number of G is at least n0.1.

AB - It is shown that there is a graph L with n vertices and at least n1.36 edges such that it contains neither L3 nor K2, 3 but every subgraph with 2n 4 3(log n)2 edges contains a C4, (n > nO). Moreover, chromatic number of G is at least n0.1.

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

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

U2 - 10.1016/0012-365X(94)90287-9

DO - 10.1016/0012-365X(94)90287-9

M3 - Article

AN - SCOPUS:38149147656

VL - 126

SP - 407

EP - 410

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -