🌱 garden

Recent Notes

  • CardWise

    Jul 17, 2025

  • ChronoArc

    Jul 17, 2025

  • rollspire

    Jul 17, 2025

  • GENB045 ΠœΠ°Ρ‚Π΅ΠΌΠ°Ρ‚ΠΈΡ‡Π΅ΡΠΊΠΈ Π°Π½Π°Π»ΠΈΠ·

    Jun 14, 2025

Tournament

Jun 14, 20251 min read

A tournament is a directed graph obtained by assigning a direction for each edge in an undirected complete graph.

In every tournament there’s a Hamiltonian path.

Every strongly connected 1 tournament has a Hamiltonian cycle.

Footnotes

  1. strongly connected: a graph is said to be strongly connected if every vertex is reachable from every other vertex ↩


Graph View

Created with Quartz v4.5.1 Β© 2025

  • GitHub
  • Mastodon
  • simply superb.