Ivan Shishkin, Rye (1878)

Problems/Graph theoryExerciseUnreviewed

Un nombre minimal de sommets pour les graphes connexes.

by T.W·
19
Difficulty scaleÉchelle de difficulté

This score reflects both the level of the required concepts and the difficulty of the solution.Ce score tient compte à la fois du niveau des notions nécessaires et de la difficulté de la résolution.

  1. 1–10First steps / middle schoolPremiers pas / collège
  2. 11–25Beginner / high schoolDébutant / lycée
  3. 26–50Intermediate / undergraduateIntermédiaire / licence
  4. 51–70Advanced / graduateAvancé / master
  5. 71–90Expert / specializedExpert / spécialisé
  6. 91–100Research levelNiveau recherche
These levels are approximate guides.Ces niveaux sont des repères approximatifs.
·
Français
FrançaisAdd translation

Showing the Français version because no English translation exists yet. Add that translation.

Unreviewed. This problem has not been reviewed by trusted users yet.

Soit GG, un graphe à nn sommets. Montrer que si GG est connexe, alors il possède au moins n−1n-1 arêtes.

I solved itMark it doneAdd to my listKeep it in your list
I like this problem0 likes

Solutions

0
Report

For an unclear, ambiguous, or possibly incorrect statement, please use the Discussion tab on the right. Report content that needs moderator intervention, such as dangerous, clearly non-mathematical, or plagiarized content.