HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /The complete bipartite graph K_(m,n) joins each of m left vertices to each of n right vertices…
AdvancedMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryNumericalreasoningOlympiad

The complete bipartite graph K_(m,n) joins each of m left vertices to each of n right vertices…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

The complete bipartite graph Km,nK_{m,n}Km,n​ joins each of mmm left vertices to each of nnn right vertices. Consider all pairs with 1≤m≤n≤61 \le m \le n \le 61≤m≤n≤6, which is 212121 graphs.

Find the degrees in Km,nK_{m,n}Km,n​. Find how many of the 212121 graphs have an Euler circuit. Then find how many have an Euler trail that is not a circuit, and list them. Every Km,nK_{m,n}Km,n​ is connected, so only the degrees matter.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

A tree on nnn vertices has n−1n - 1n−1 edges; a forest with ccc components has n−cn - cn−c. Bipartite means no odd cycle; with no triangle, E≤n24E \le \dfrac{n^2}{4}E≤4n2​. A connected graph has an Euler circuit when all degrees are even, and an Euler trail when exactly two are odd.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. Degrees. Each left vertex has degree nnn; each right vertex has degree mmm.

Step 2. Circuits. All degrees are even when mmm and nnn are both even: (2,2)(2, 2)(2,2), (2,4)(2, 4)(2,4), (2,6)(2, 6)(2,6), (4,4)(4, 4)(4,4), (4,6)(4, 6)(4,6), (6,6)(6, 6)(6,6). That is 666 graphs.

Step 3. Exactly two odd vertices. If nnn is odd, the mmm left vertices are odd; if mmm is odd, the nnn right vertices are odd.

  • mmm even, nnn odd: we need m=2m = 2m=2, giving (2,3)(2, 3)(2,3) and (2,5)(2, 5)(2,5).
  • mmm odd, nnn even: we need n=2n = 2n=2, so m=1m = 1m=1, giving (1,2)(1, 2)(1,2).
  • Both odd: m+n=2m + n = 2m+n=2, so (1,1)(1, 1)(1,1), a single edge.

Step 4. Count. 444 graphs: K1,1K_{1,1}K1,1​, K1,2K_{1,2}K1,2​, K2,3K_{2,3}K2,3​ and K2,5K_{2,5}K2,5​.

Answer: 666 graphs with an Euler circuit and 444 with a trail only.

Log in to save this for later
← All Problems
← A river town has five land areas, A, B, C, D and E, joined by ten bridges…A connected planar graph with 10 vertices is drawn without crossings, and every face of the… →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Trees, bipartite graphs and Euler trailsGraph Theory

More on this topic

  1. The 15 edges of K₆ are coloured red or blue…Advanced
  2. Three houses each need a path to each of three wells, nine paths in all, drawn on flat ground…Advanced
  3. A connected planar graph with 10 vertices is drawn without crossings, and every face of the…Hard
  4. A river town has five land areas, A, B, C, D and E, joined by ten bridges…
Hard
  • In a group of 6 students, some pairs are friends…Advanced
  • All problems on this topic →