We study in this Note the existence of claws in digraphs. We extend a result of Saks and Sós to the tournament-like digraphs.
Nous étudions dans cette Note le problème de l'existence des arbres simples dans les graphes orientés. Nous étendons un resultat de Saks et Sós aux graphes orientés presque complets.
Accepted:
Published online:
Amine El Sahili 1; Mekkia Kouider 2
@article{CRMATH_2008__346_1-2_1_0, author = {Amine El Sahili and Mekkia Kouider}, title = {Claws in digraphs}, journal = {Comptes Rendus. Math\'ematique}, pages = {1--4}, publisher = {Elsevier}, volume = {346}, number = {1-2}, year = {2008}, doi = {10.1016/j.crma.2007.10.040}, language = {en}, }
Amine El Sahili; Mekkia Kouider. Claws in digraphs. Comptes Rendus. Mathématique, Volume 346 (2008) no. 1-2, pp. 1-4. doi : 10.1016/j.crma.2007.10.040. https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.1016/j.crma.2007.10.040/
[1] About paths with two blocks, J. Graph Theory, Volume 55 (2007), pp. 221-226
[2] On directed paths and circuits (P. Erdös; G. Katona, eds.), Theory of Graphs, Academic Press, 1968, pp. 115-118
[3] Median order of tournaments: A tool for the second neighborhood problem and Sumner's conjecture, J. Graph Theory Ser. B, Volume 35 (2000), pp. 244-256
[4] Nombre chromatique et plus longs chemins d'un graphe, Rev. Française Automat. Informat. Recherche Opérationelle Sér. Rouge, Volume 1 (1967), pp. 127-132
[5] On unavoidable subgraphs of tournaments, Finite and Infinite Sets. Eger (Hungary), Colloquia Mathematica Societatis János Bolyai, vol. 37, 1981, pp. 663-674
Cited by Sources:
Comments - Policy