| Display title | Talk:Graph theory |
| Default sort key | Graph theory |
| Page length (in bytes) | 250 |
| Namespace ID | 1 |
| Namespace | Talk |
| Page ID | 2059 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | BetterVotingAdvocacy (talk | contribs) |
| Date of page creation | 23:02, 24 March 2020 |
| Latest editor | BetterVotingAdvocacy (talk | contribs) |
| Date of latest edit | 23:02, 24 March 2020 |
| Total number of edits | 1 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Would anyone be able to help explain Schulze STV's use of flow (related to graph theory) to figure out which winner sets are best? BetterVotingAdvocacy (talk) 23:01, 24 March 2020 (UTC) |
