Abstract In this paper we solve a conjecture of P. Erdos by showing that if a graph G n has n vertices and at least 100kn 1+ 1 k edges, then G contains a cycle C 2 l of length 2 l for every integer l… Expand

Given two graphs G 1 , G 2 , the Ramsey number R ( G 1 , G 2 ) is the smallest integer m such that, for any partition ( E 1 , E 2 ) of the edges of K m , either G 1 is a subgraph of the graph induced… Expand

On presente un algorithme polynomial permettant de determiner un sous-graphe biparti d'un graphe G sans triangle ni boucle de degre maximum 3, contenant au moins 4/5 des aretes de G. On caracterise… Expand