A Disproof of a Conjecture of Erdős in Ramsey Theory

@inproceedings{Thomason1989ADO,
  title={A Disproof of a Conjecture of Erdős in Ramsey Theory},
  author={Andrew Thomason},
  year={1989}
}
Contre-exemples a la conjecture de Erdos et discussion des proprietes des graphes extremaux 

Figures and Tables from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 49 CITATIONS

Odd cycles in subgraphs of sparse pseudorandom graphs

  • 2019
VIEW 4 EXCERPTS
CITES RESULTS & METHODS
HIGHLY INFLUENCED

A Note on the Inducibility of $$4$$4-Vertex Graphs

  • Graphs and Combinatorics
  • 2015
VIEW 11 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Non-Three-Colourable Common Graphs Exist

  • Combinatorics, Probability & Computing
  • 2012
VIEW 7 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

The minimum number of monochromatic 4-term progressions in Z

VIEW 9 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

The Ramsey number of books

VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Recent developments in graph Ramsey theory

  • Surveys in Combinatorics
  • 2015
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

On Finite Ramsey Numbers

  • Eur. J. Comb.
  • 1982
VIEW 2 EXCERPTS

THOMASON, 'Graphs which contain all small graphs

A. B. BOLLOBAS
  • European J. Combin
  • 1981
VIEW 1 EXCERPT

SEIDEL, 'A survey of two-graphs', Colloquio inlernazionale sulle teorie combinatorie, Atti dei Convegni Lincei 17 (Accad

J J.
  • Naz. Lincei, Roma,
  • 1976
VIEW 3 EXCERPTS

HUBAUT, 'Strongly regular graphs

X L.
  • Discrete Math
  • 1975
VIEW 2 EXCERPTS

SPENCER, 'A constructive solution to a tournament problem

J.H.R.L. GRAHAM
  • Canad. Math. Bull
  • 1971
VIEW 1 EXCERPT

Nouvelles majorations des nombres de Ramsey binairesbicolores

A. BLANCHARD, quoted by G. Giraud
  • C.R. Acad. Sci. Paris Se'r. A
  • 1969
VIEW 1 EXCERPT