The size Ramsey number of a directed path

[1]  Ron Aharoni,et al.  Acyclic systems of representatives and acyclic colorings of digraphs , 2008, J. Graph Theory.

[2]  Avi Wigderson,et al.  2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction , 2006, STOC '06.

[3]  Reinhard Diestel,et al.  Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs , 2006, Comb..

[4]  Guy Kindler,et al.  Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors , 2005, STOC '05.

[5]  David Reimer,et al.  The Ramsey size number of dipaths , 2002, Discret. Math..

[6]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[7]  Noga Alon,et al.  Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory , 1986, Comb..

[8]  József Beck,et al.  On size Ramsey number of paths, trees, and circuits. I , 1983, J. Graph Theory.

[9]  András Gyárfás,et al.  Vertex coverings by monochromatic paths and cycles , 1983, J. Graph Theory.

[10]  P. Erdos,et al.  The size Ramsey number , 1978 .

[11]  H. Raynaud,et al.  Sur le circuit hamiltonien bi-coloré dans les graphes orientés , 1973 .

[12]  P. Erdos,et al.  On a Ramsey type theorem , 1972 .

[13]  Noga Alon,et al.  The Probabilistic Method, Third Edition , 2008, Wiley-Interscience series in discrete mathematics and optimization.

[14]  Michael Molloy,et al.  The Probabilistic Method , 1998 .

[15]  N. Alon,et al.  The Probabilistic Method , 1992, SODA.

[16]  Joel Friedman,et al.  Expanding graphs contain all small trees , 1987, Comb..

[17]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[18]  B. Roy.  Nombre chromatique et plus longs chemins d'un graphe , 1967 .

[19]  O. Ore.  Theory of Graphs , 1962 .