Sur les graphes admettant le nombre maximum de sous-graphes à trois sommets et deux arêtes, et les paires d'ordres totaux qui maximisent | Rho- Tau|. (On the graphs which admit the maximal number of subgraphs on three vertices and with two edges

DOI10.1016/S0195-6698(88)80054-4zbMATH Open0723.05072MaRDI QIDQ757415FDOQ757415

Authors: Claude Le Conte de Poly-Barbut 

Publication date: 1988

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3958463
• scientific article; zbMATH DE number 3188526
• Relation between the Kendall and Spearman coefficients and concordance graphs
• Transitive Orientations of Graphs
• Two path extremal graphs and an application to a Ramsey-type problem

zbMATH Keywords

balanced bipartite complete graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• Relation between the Kendall and Spearman coefficients and concordance graphs
• On the comparison of the Spearman and Kendall metrics between linear orders.
• Concordance between two linear orders: The Spearman and Kendall coefficients revisited

This page was built for publication: Sur les graphes admettant le nombre maximum de sous-graphes à trois sommets et deux arêtes, et les paires d'ordres totaux qui maximisent \(| Rho\)- Tau\(|\). (On the graphs which admit the maximal number of subgraphs on three vertices and with two edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757415)