The Triangle-Free Process and the Ramsey Number R(3,k)

The Triangle-Free Process and the Ramsey Number R(3,k)

The areas of Ramsey theory and random graphs have been closely linked ever since Erdős's famous proof in 1947 that the ""diagonal"" Ramsey numbers R(k) grow exponentially in k. In the early 1990s, the triangle-free process was introduced as a model which might potentially p...

Full description

Saved in:
Bibliographic Details
Main Author: Pontiveros, Gonzalo Fiz
Other Authors: Griffiths, Simon, Morris, Robert
Format: eBook
Language:English
Published: Providence : American Mathematical Society, 1920.
Series:Memoirs of the American Mathematical Society Ser.
Subjects:
Ramsey theory.
Combinatorial analysis.
Combinatorial analysis
Ramsey theory
Probability theory and stochastic processes {For additional applications, see 11Kxx, 62-XX, 90-XX, 91-XX, 92-XX, 93-XX, 94-XX} > Combinatorial probability > Combinatorial probability.
Combinatorics {For finite fields, see 11Txx} > Extremal combinatorics > Ramsey theory [See also 05C55].
Combinatorics {For finite fields, see 11Txx} > Extremal combinatorics > Probabilistic methods.
Online Access:Click for online access
Login for hold information

‌

Click for online access

Online

Holdings details from Online
Status: Available

Similar Items